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...
Amortized running time is a realistic but robust complexity measure for which we can obtain surprisingly tight upper and lower bo... Tarjan,R Endre - 《Siam Journal on Algebraic & Discrete Methods》 被引量: 930发表: 1985年 Binary Search Trees of Bounded Balance A new class of binary search...
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 pol y ( n ) . Thus we can only show that ``very hard'' LPN is ...
A search tree strategy has been proposed to reduce the searching time in the MPC context [14], [15]. If the process model or the controller tuning parameters change, however, the computation of the regions has to be done again. This field continues evolving and new and more elaborate ...
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 ...