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...
caused a whole page of submissions to topple like dominoes. And don’t get me started on the terminology — it's "contiguous subsequence," not "continuous." Google could have corrected you, for crying out loud! Then there was E. Another nightmare with weak pretests and ridiculous O(nt) ...
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 ...
This is the case when the prediction horizon is small or when a complexity reduction strategy like that of [8] is used. When fast dynamics are to be controlled the min-max problem cannot be solved numerically, and approximate solutions have to be used [9], [10]. However, these ...
The caveat is that this worst case problem is only mildly hard and in particular admits a quasi-polynomial time algorithm, whereas the LPN variant used in the reduction requires extremely high noise rate of 1 2 ? 1 pol y ( n ) . Thus we can only show that ``very hard'' LPN is ...
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....
The caveat is that this worst case problem is only mildly hard and in particular admits a quasi-polynomial time algorithm, whereas the LPN variant used in the reduction requires extremely high noise rate of 1/2 - 1/poly(n). Thus we can only show that "very hard" LPN is harder than ...