Results 1  10
of
1,603,518
TimeSpace Lower Bounds for Satisfiability
 JACM
, 2005
"... We establish the first polynomial timespace lower bounds for satisfiability on general models of computation. We show that for any constant c less than the golden ratio there exists a positive constant d such that no deterministic randomaccess Turing machine can solve satisfiability in time n c an ..."
Abstract

Cited by 28 (8 self)
 Add to MetaCart
We establish the first polynomial timespace lower bounds for satisfiability on general models of computation. We show that for any constant c less than the golden ratio there exists a positive constant d such that no deterministic randomaccess Turing machine can solve satisfiability in time n c
TimeSpace Lower Bounds for Satisfiability
 In Proceedings of the 31st International Colloquium on Automata, Languages and Programming (ICALP
, 2001
"... We survey the recent lower bounds on the running time of generalpurpose randomaccess machines that solve satisfiability in a small amount of work space, and related lower bounds for satisfiability in nonuniform models. ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
We survey the recent lower bounds on the running time of generalpurpose randomaccess machines that solve satisfiability in a small amount of work space, and related lower bounds for satisfiability in nonuniform models.
A time lower bound for satisfiability
 In Proceedings of the 31st International Colloquium on Automata, Languages and Programming (ICALP
, 2004
"... Abstract. We show that a deterministic Turing machine with one ddimensional work tape and random access to the input cannot solve satisfiability in time na for a < p(d + 2)/(d + 1). For conondeterministic machines, we obtain a similar lower bound for any a such that a3 < 1 + a/(d + 1). The sam ..."
Abstract

Cited by 6 (1 self)
 Add to MetaCart
depthcircuits) and polynomial lower bounds on somewhat restricted models (e.g., for palindromes on single tape Turing machines) but no nontrivial lower bounds ongeneral randomaccess machines. In this paper, we exploit the recent timespace lower bounds for satisfiability on general randomaccess machines
TimeSpace Tradeoffs for Satisfiability
 Journal of Computer and System Sciences
, 1997
"... We give the first nontrivial modelindependent timespace tradeoffs for satisfiability. Namely, we show that SAT cannot be solved simultaneously in n 1+o(1) time and n 1\Gammaffl space for any ffl ? 0 on general randomaccess nondeterministic Turing machines. In particular, SAT cannot be solved ..."
Abstract

Cited by 37 (1 self)
 Add to MetaCart
We give the first nontrivial modelindependent timespace tradeoffs for satisfiability. Namely, we show that SAT cannot be solved simultaneously in n 1+o(1) time and n 1\Gammaffl space for any ffl ? 0 on general randomaccess nondeterministic Turing machines. In particular, SAT cannot
Improved Approximation Algorithms for Maximum Cut and Satisfiability Problems Using Semidefinite Programming
 Journal of the ACM
, 1995
"... We present randomized approximation algorithms for the maximum cut (MAX CUT) and maximum 2satisfiability (MAX 2SAT) problems that always deliver solutions of expected value at least .87856 times the optimal value. These algorithms use a simple and elegant technique that randomly rounds the solution ..."
Abstract

Cited by 1231 (13 self)
 Add to MetaCart
We present randomized approximation algorithms for the maximum cut (MAX CUT) and maximum 2satisfiability (MAX 2SAT) problems that always deliver solutions of expected value at least .87856 times the optimal value. These algorithms use a simple and elegant technique that randomly rounds
A New Method for Solving Hard Satisfiability Problems
 AAAI
, 1992
"... We introduce a greedy local search procedure called GSAT for solving propositional satisfiability problems. Our experiments show that this procedure can be used to solve hard, randomly generated problems that are an order of magnitude larger than those that can be handled by more traditional approac ..."
Abstract

Cited by 734 (21 self)
 Add to MetaCart
We introduce a greedy local search procedure called GSAT for solving propositional satisfiability problems. Our experiments show that this procedure can be used to solve hard, randomly generated problems that are an order of magnitude larger than those that can be handled by more traditional
A Limited Memory Algorithm for Bound Constrained Optimization
 SIAM Journal on Scientific Computing
, 1994
"... An algorithm for solving large nonlinear optimization problems with simple bounds is described. ..."
Abstract

Cited by 557 (9 self)
 Add to MetaCart
An algorithm for solving large nonlinear optimization problems with simple bounds is described.
Plans And ResourceBounded Practical Reasoning
 COMPUTATIONAL INTELLIGENCE, 4(4):349355, 1988
, 1988
"... An architecture for a rational agent must allow for meansend reasoning, for the weighing of competing alternatives, and for interactions between these two forms of reasoning. Such an architecture must also address the problem of resource boundedness. We sketch a solution of the first problem that p ..."
Abstract

Cited by 485 (19 self)
 Add to MetaCart
that points the way to a solution of the second. In particular, we present a highlevel specification of the practicalreasoning component of an architecture for a resourcebounded rational agent. In this architecture, a major role of the agent's plans is to constrain the amount of further practical
Space/Time Tradeoffs in Hash Coding with Allowable Errors
 Communications of the ACM
, 1970
"... this paper tradeoffs among certain computational factors in hash coding are analyzed. The paradigm problem considered is that of testing a series of messages onebyone for membership in a given set of messages. Two new hash coding methods are examined and compared with a particular conventional h ..."
Abstract

Cited by 2067 (0 self)
 Add to MetaCart
hashcoding method. The computational factors considered are the size of the hash area (space), the time required to identify a message as a nonmember of the given set (reject time), and an allowable error frequency
Results 1  10
of
1,603,518