• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Tools

Sorted by:
Try your query at:
Semantic Scholar Scholar Academic
Google Bing DBLP
Results 1 - 10 of 474
Next 10 →

Super-Linear Time-Space Tradeoff Lower Bounds for Randomized Computation

by Paul Beame, Michael Saks, Xiaodong Sun, Erik Vee , 2000
"... We prove the first time-space 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 time-space 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

Time-Space Tradeoffs for Satisfiability

by Lance Fortnow - Journal of Computer and System Sciences , 1997
"... We give the first nontrivial model-independent time-space 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 random-access nondeterministic Turing machines. In particular, SAT cannot be solved ..."
Abstract - Cited by 37 (1 self) - Add to MetaCart
We give the first nontrivial model-independent time-space 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 random-access nondeterministic Turing machines. In particular, SAT cannot

Time-Space Tradeoff Lower Bounds for Randomized Computation of Decision Problems

by Paul Beame, Michael Saks, Xiaodong Sun, Erik Vee - In Proc. of 41st FOCS , 2000
"... We prove the first time-space lower bound tradeoffs for randomized computation of decision problems. ..."
Abstract - Cited by 35 (5 self) - Add to MetaCart
We prove the first time-space lower bound tradeoffs for randomized computation of decision problems.

Time-Space Tradeoff Lower Bounds for Integer . . .

by Martin Sauerhoff, et al. , 2003
"... We prove exponential size lower bounds for nondeterministic and randomized read-k BPs as well as a time-space tradeoff lower bound for unrestricted, deterministic multi-way BPs computing the middle bit of integer multiplication. The lower bound for randomized read-k BPs is superpolynomial as long as ..."
Abstract - Add to MetaCart
We prove exponential size lower bounds for nondeterministic and randomized read-k BPs as well as a time-space tradeoff lower bound for unrestricted, deterministic multi-way BPs computing the middle bit of integer multiplication. The lower bound for randomized read-k BPs is superpolynomial as long

Time-space tradeoff lower bounds for randomized computation of decision

by Paul Beamey, Michael Saksz, Xiaodong Sunz, Erik Veey , 2002
"... problems ..."
Abstract - Add to MetaCart
Abstract not found

Time-space tradeoff lower bounds for integer . . . (Extended Abstract)

by Martin Sauerhoff, et al. , 2003
"... We prove exponential size lower bounds for nondeterministic and randomized read-k BPs as well as a time-space tradeoff lower bound for unrestricted, deterministic multi-way BPs computing the middle bit of integer multiplication. The lower bound for randomized read-k BPs is superpolynomial as long ..."
Abstract - Cited by 8 (2 self) - Add to MetaCart
We prove exponential size lower bounds for nondeterministic and randomized read-k BPs as well as a time-space tradeoff lower bound for unrestricted, deterministic multi-way BPs computing the middle bit of integer multiplication. The lower bound for randomized read-k BPs is superpolynomial as long

on Time–Space Tradeoffs for Branching

by Paul Beame, T. S. Jayram, Michael Saks , 1999
"... We obtain the first non-trivial time–space tradeoff lower bound for func-tions 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 non-trivial time–space tradeoff lower bound for func-tions 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

Time-Space Lower Bounds for Satisfiability

by Lance Fortnow, Richard Lipton, Dieter van Melkebeek, Anastasios Viglas , 2004
"... We establish the first polynomial time-space 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 random-access Turing machine can solve satisfiability in time n c an ..."
Abstract - Cited by 28 (7 self) - Add to MetaCart
We establish the first polynomial time-space 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 random-access Turing machine can solve satisfiability in time n c

Time-Space Tradeoffs for Branching Programs

by Paul Beame, Michael Saks, Jayram S. Thathachar , 1999
"... We obtain the first non-trivial time-space 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 non-trivial time-space 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 time-space tradeoff for sorting on a general sequential model of computation

by A. Borodin, S. Cook - 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, time-space tradeoffs, conputational complexity, sorting, time lower bounds, space lower bounds
Next 10 →
Results 1 - 10 of 474
Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University