Inductive Time-Space Lower Bounds for Sat and Related Problems
نویسندگان
چکیده
منابع مشابه
Time-space Lower Bounds for Satisfiability and Related Problems on Randomized Machines
Computational complexity studies the resources required for computers to solve certain problems; deciding satisfiability of Boolean formulas is one of the most fundamental such problems. This thesis proves lower bounds on the time and memory space required to solve satisfiability and related problems on randomized machines. We establish the first randomized time-space lower bounds for the probl...
متن کاملConditional Lower Bounds for Space/Time Tradeoffs
In recent years much effort has been concentrated towards achieving polynomial time lower bounds on algorithms for solving various well-known problems. A useful technique for showing such lower bounds is to prove them conditionally based on well-studied hardness assumptions such as 3SUM, APSP, SETH, etc. This line of research helps to obtain a better understanding of the complexity inside P. A ...
متن کاملOn polynomial lower bounds based on complexity of SAT problems
A large amount of recent work in complexity theory seeks to prove tight lower bounds on problems within P under the Strong Exponential Time Hypothesis (SETH) and similar conjectures. Lower bounds for many problems can be proved via reduction from CNF formulas under SETH. More recently, work by Abboud, Hansen, Williams and Williams [3] proves bounds under reductions from more complex representat...
متن کاملImproved Lower Bounds for the Shortest Superstring and Related Problems
We study the approximation hardness of the Shortest Superstring, the Maximal Compression and the Maximum Asymmetric Traveling Salesperson (MAX-ATSP) problem. We introduce a new reduction method that produces strongly restricted instances of the Shortest Superstring problem, in which the maximal orbit size is eight (with no character appearing more than eight times) and all given strings having ...
متن کاملLower Bounds for Discrete Logarithms and Related Problems
This paper considers the computational complexity of the discrete logarithm and related problems in the context of \generic algorithms"|that is, algorithms which do not exploit any special properties of the encodings of group elements, other than the property that each group element is encoded as a unique binary string. Lower bounds on the complexity of these problems are proved that match the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: computational complexity
سال: 2006
ISSN: 1016-3328,1420-8954
DOI: 10.1007/s00037-007-0221-1