The epsilon-subdifferential of convex univariate piecewise linear-quadratic (PLQ) functions can be computed in linear worst-case time complexity as the level-set of a convex function. Using binary search, we improve the complexity to logarithmic worst-case time, and prove such complexity is optimal...
In this work, we address this problem and propose non-interactive highly efficient SSE schemes that handlearbitrarydisjunctive and boolean queries with worst-case sub-linear search and optimal communication complexity. Our main construction, called IEX, makes black-box use of an underlying single keywo...
to Analyze Algorithm Performance Based on the Worst-case Instances - Jeon, Kim - 2010 () Citation Context ...emert [8] tried to find the worst case of some algorithms for binary constraint satisfaction, Boolean satisfiability, and the travelling salesperson problem, in terms of time complexity....
We present a worst case decoding problem whose hardness reduces to that of solving the Learning Parity with Noise (LPN) problem, in some parameter regime. Prior to this work, no worst case hardness result was known for LPN (as opposed to syntactically similar problems such as Learning with Er...
Then there was E. Another nightmare with weak pretests and ridiculous O(nt) solutions passing (and of course, the legendarystilssomehow using some kind of black magic to withstand about 300 hacks of a nonsense O(nt) solution, including about twenty from my friendrika). Of course, it is ...
Due to the computational complexity, only the special case of leave-1-out is widely used [8, 11, 12]. Commonly used non-exhaustive cross validation criteria include m-fold [13, 14], holdout [15], random sampling [16], etc. It is worth mentioning that leave-k-out is the exhaustive ...
In this case, computing the worst case cost implies the solution of a quadratic maximization problem with a computational complexity that is exponential with the prediction horizon. In this paper an efficient upper bound of a quadratic maximization problem over a hypercube is presented. It is based...
1 pol y ( n ) .Our proof relies on a smoothing lemma for codes which we show to have further implications: We show that ( n m w ) -NCP with the aforementioned parameters lies in the complexity class Search ? B P P SZ K (i.e.\\ reducible to a problem that has a statistical ...
to Analyze Algorithm Performance Based on the Worst-case Instances - Jeon, Kim - 2010 () Citation Context ...emert [8] tried to find the worst case of some algorithms for binary constraint satisfaction, Boolean satisfiability, and the travelling salesperson problem, in terms of time complexity....
Our proof relies on a smoothing lemma for codes which we show to have further implications: We show that (n, m, w)-NCP with the aforementioned parameters lies in the complexity class Search-BPP~(SZK) (i.e. reducible to a problem that has a statistical zero knowledge protocol) implying ...