Results 1  10
of
474
SuperLinear TimeSpace Tradeoff Lower Bounds for Randomized Computation
, 2000
"... We prove the first timespace lower bound tradeoffs for randomized computation of decision problems. The bounds hold even in the case that the computation is allowed to have arbitrary probability of error on a small fraction of inputs. Our techniques are an extension of those used by Ajtai [Ajt99a, ..."
Abstract

Cited by 33 (2 self)
 Add to MetaCart
We prove the first timespace lower bound tradeoffs for randomized computation of decision problems. The bounds hold even in the case that the computation is allowed to have arbitrary probability of error on a small fraction of inputs. Our techniques are an extension of those used by Ajtai [Ajt99a
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
TimeSpace Tradeoff Lower Bounds for Randomized Computation of Decision Problems
 In Proc. of 41st FOCS
, 2000
"... We prove the first timespace lower bound tradeoffs for randomized computation of decision problems. ..."
Abstract

Cited by 35 (5 self)
 Add to MetaCart
We prove the first timespace lower bound tradeoffs for randomized computation of decision problems.
TimeSpace Tradeoff Lower Bounds for Integer . . .
, 2003
"... We prove exponential size lower bounds for nondeterministic and randomized readk BPs as well as a timespace tradeoff lower bound for unrestricted, deterministic multiway BPs computing the middle bit of integer multiplication. The lower bound for randomized readk BPs is superpolynomial as long as ..."
Abstract
 Add to MetaCart
We prove exponential size lower bounds for nondeterministic and randomized readk BPs as well as a timespace tradeoff lower bound for unrestricted, deterministic multiway BPs computing the middle bit of integer multiplication. The lower bound for randomized readk BPs is superpolynomial as long
Timespace tradeoff lower bounds for integer . . . (Extended Abstract)
, 2003
"... We prove exponential size lower bounds for nondeterministic and randomized readk BPs as well as a timespace tradeoff lower bound for unrestricted, deterministic multiway BPs computing the middle bit of integer multiplication. The lower bound for randomized readk BPs is superpolynomial as long ..."
Abstract

Cited by 8 (2 self)
 Add to MetaCart
We prove exponential size lower bounds for nondeterministic and randomized readk BPs as well as a timespace tradeoff lower bound for unrestricted, deterministic multiway BPs computing the middle bit of integer multiplication. The lower bound for randomized readk BPs is superpolynomial as long
on Time–Space Tradeoffs for Branching
, 1999
"... We obtain the first nontrivial time–space tradeoff lower bound for functions f: {0, 1}nQ {0, 1} on general branching programs by exhibiting a Boolean function f that requires exponential size to be computed by any branching program of length (1+e) n, for some constant e> 0. We also give the fir ..."
Abstract
 Add to MetaCart
We obtain the first nontrivial time–space tradeoff lower bound for functions f: {0, 1}nQ {0, 1} on general branching programs by exhibiting a Boolean function f that requires exponential size to be computed by any branching program of length (1+e) n, for some constant e> 0. We also give
TimeSpace Lower Bounds for Satisfiability
, 2004
"... 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 (7 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 Tradeoffs for Branching Programs
, 1999
"... We obtain the first nontrivial timespace tradeoff lower bound for functions f : {0, 1}^n → {0, 1} on general branching programs by exhibiting a Boolean function f that requires exponential size to be computed by any branching program of length (1 + ε)n, for some constant & ..."
Abstract

Cited by 46 (4 self)
 Add to MetaCart
We obtain the first nontrivial timespace tradeoff lower bound for functions f : {0, 1}^n → {0, 1} on general branching programs by exhibiting a Boolean function f that requires exponential size to be computed by any branching program of length (1 + ε)n, for some constant &
A timespace tradeoff for sorting on a general sequential model of computation
 SIAM Journal on Computing
, 1982
"... Abstract. In a general sequential model of computation, no restrictions are placed on theway in which the computation may proceed, except that parallel operations are not allowed. We show that in such an unrestricted environment TIME.SPACE fl(N2/logN) in order to sort N integers, each in the range [ ..."
Abstract

Cited by 64 (6 self)
 Add to MetaCart
[,N]. Key words, timespace tradeoffs, conputational complexity, sorting, time lower bounds, space lower bounds
Results 1  10
of
474