A Time Lower Bound for Satisfiability. - Internet Archive Scholar

For conondeterministic machines, we obtain a similar lower bound for any a such that a 3 < 1 + a/(d + 1). The same bounds apply to almost all natural NP-complete problems known. ... We show that a deterministic Turing machine with one d-dimensional work tape and random access to the input cannot solve satisfiability in time n a for a < (d + 2)/(d + 1). ... Acknowledgments We would like to thank Ravi Kannan, Rahul Santhanam, and the anonymous ICALP referees for helpful discussions, pointers to the literature, and other suggestions. ...

doi:10.1007/978-3-540-27836-8_81 fatcat:4wfv4lejlngonj65wb7qkovr4i

For conondeterministic machines, we obtain a similar lower bound for any a such that a 3 < 1 + a/(d + 1). The same bounds apply to almost all natural NP-complete problems known. ... We show that a deterministic Turing machine with one d-dimensional work tape and random access to the input cannot solve satisfiability in time n a for a < √ (d + 2)/(d + 1). ... Acknowledgements We would like to thank Ravi Kannan, Rahul Santhanam, and the anonymous ICALP referees for helpful discussions, pointers to the literature, and other suggestions. ...

doi:10.1016/j.tcs.2005.09.020 fatcat:2zbggupixjgsvd5fxcywgliopu

Szczepanski

These connections have made it possible to prove new complexity lower bounds that had long been conjectured, and they suggest concrete directions for further progress. ... Surprisingly, even minor algorithmic progress on solving the circuit satisfiability problem faster than exhaustive search can be applied to prove strong circuit complexity lower bounds. ... In particular, circuit size lower bounds for the class ACC have been proved by designing new algorithms for satisfiability of ACC circuits [2] . ...

doi:10.1007/978-3-642-21581-0_1 fatcat:3bpt4mnhbbg5fjmpjtda5ymtca

The upper bound of an event is the maximum time taken for an event to repeat itself. Likewise, the lower bound is the minimum time taken. ... Specification upper and lower bounds (U/L): After proving that the model meets its timing requirements, an upper and lower bound for every event in the Modechart may be obtained through simulation. ...

His result exploits a formal connection from non-trivial SAT algorithms to circuit lower bounds. ... I discuss recent progress in developing and exploiting connections between SAT algorithms and circuit lower bounds. ... Acknowledgements I am grateful to Vikraman Arvind for commissioning a version of this article for the Bulletin of the European Association for Theoretical Computer Science. ...

dblp:journals/eccc/Santhanam12 fatcat:u6kczbzxxjhmph7tlj2p3opjh4

Szczepanski

bound cannot be fixed parameter tractable unless P = NP, for a number of NP-optimization problems. ... We next introduce the notion of 'tight' upper and lower bounds for the optimum solution and show that the parameterized version of a variant of the above guarantee question with respect to the tight lower ... Thus the polynomial-time computable lower bound that we exhibit in Proposition 1 is a special lower bound obtained from a specific L-reduction to a specific complete problem (Max 3-Sat) for the class MAX ...

doi:10.1007/11847250_4 fatcat:ws22q7uuczb45o4qufksfzkbxy

The objective of this research is to come up with a novel approach so as to find similar temporal association patterns w.r.t user specified threshold and a given reference support time sequence using concept ... A Temporal database is a database which can store past, present and future information. ... Now, find the upper-lower bound , lower-lower bound, and lower bound values for temporal pattern, . ...

arXiv:1604.05272v1 fatcat:f7ekbpf5grcptar5s7fv4poeka

Open Access

This improves upon the previous √ ∆ lower bound in [11, 4] and is much closer to the current upper bound of (∆ + 2 √ ∆ + 2) in [7] . Furthermore, for small values of ∆ we give better lower bounds. ... In the case that pages may have different lengths, we prove a lower bound of Ω(∆/ log ∆) on the competitive ratio where ∆ is the ratio of maximum to minimum page lengths. ... He then complemented his upper bound with several lower bounds, including a tight lower bound for this special case of unit page length. ...

doi:10.1007/11809678_34 fatcat:trv6ujflbrbxlcaedlrmqvrdoe

This improves upon the previous √ ∆ lower bound in [11, 4] and is much closer to the current upper bound of (∆ + 2 √ ∆ + 2) in [7] . Furthermore, for small values of ∆ we give better lower bounds. ... In the case that pages may have different lengths, we prove a lower bound of Ω(∆/ log ∆) on the competitive ratio where ∆ is the ratio of maximum to minimum page lengths. ... He then complemented his upper bound with several lower bounds, including a tight lower bound for this special case of unit page length. ...

doi:10.1007/s10951-007-0036-6 fatcat:ev5ywbj5pbdv5ijr5v2ginr2k4

The third objective is to design novel expressions to find the lower bound support sequence and upper bound support sequence by defining two functions called sum and XOR over temporal patterns. ... This concept of traditional support value does not hold good to discover similar temporal association patterns for a known reference sequence and threshold value. ... We are also thankful for the editor, Miguel Sanchez for his cooperation and allowing us to extend the present work. ...

doi:10.21311/001.39.1.25 fatcat:rmyqccizxzcf7ack2l33kdylju

SciELO

We show that for several natural problems of interest, complexity lower bounds that are barely non-trivial imply super-polynomial or even exponential lower bounds in strong computational models. ... ACKNOWLEDGEMENTS We are grateful to Jan Krajíček, Ján Pich and Ninad Rajgopal for helpful discussions and comments. ... The antecedent here is a "mild" lower bound against quasi-linear time algorithms, while the consequent is a more significant lower bound against any polynomial-time algorithm, but for a larger class. ...

doi:10.1109/focs.2018.00016 dblp:conf/focs/OliveiraS18 fatcat:4youvi7wjfbxzn32ttjuy4c6f4

We summarize useful properties of dynamic networks and develop improved lower bounds on minimum travel times. ... node, in a class of dynamic networks the link travel times of which satisfy the first-in-first-out property. ... Lemma 6 provides a conceptual lower bound on for a node , which is on a shortest path corresponding to departure time . We refer to this lower dynamic lower bound as the dynamic lower bound. ...

doi:10.1109/6979.994796 fatcat:rcnja5ga55fephcdrhasksyxya

Numerical aspects Under the assumptions A,,) per state S; (j = | k) and known preventive replacement preparation time p > 0, we can create a table which gives the lower and upper bounds for the probability ... = 00 for all s, it is clear that the number of combinations that satisfy the lower bound condi- tion for state S; can be obtained from the number of combinations that satisfy the upper bound condition ...

Many methods have been proposed to solve this problem and a main class of them is based on some kind of paraconsistent semantics. ... We show that our algorithm satisfies some desirable properties and give experimental results of our implementation of the algorithm. ... For each w, it needs at most |Var(K)| w times tests of S-4 unsatisfiability. So it takes O( |Var(K)| w |K|w · 2 w ) time to compute a lower bound 1 − (w − 1)/|Var(K)|. ...

doi:10.1007/978-3-642-10488-6_7 fatcat:svjku63kenglnmyexswbaa7usq

This paper presents several ways to compute lower and upper bounds for MaxSAT based on calling a complete SAT solver. ... Preliminary results indicate that (i) the bounds are of high quality, (ii) the bounds can boost the search of MaxSAT solvers on some benchmarks, and (iii) the upper bounds computed by a Stochastic Local ... Note that the necessary time to compute the bounds is included in the time limit for each execution. ...

doi:10.1007/978-3-642-34413-8_35 fatcat:xh5pgcyqzjbrrjureknsyienpi

A Time Lower Bound for Satisfiability [chapter]

Preserved Fulltext