AbstractThis paper considers time-space tradeoffs for various set operations. Denoting the time requirement of an algorithm by T and its space requirement by S, it is shown that TS=Ω(n2) for set complementation and TS=Ω(n32) for set intersection, in the R-way branching program model. In the more restricted model of comparison branching programs, the paper provides two additional types of results. A tradeoff of TS=Ω(n2-ε(n)), derived from Yao's lower bound for element distinctness, is shown for set disjointness, set union and set intersection [where ε(n)=O((logn)−12)]. A bound of TS=Ω(n32) is shown for deciding set equality and set inclusion. Finally, a classification of set operations is presented, and it is shown that all problems of a lar...
A model of computat ion is introduced which permits the analysis of both the time and space requirem...
We prove the first time-space lower bound tradeoffs for randomized computation of decision problems....
AbstractWe exhibit a new method for showing lower bounds for time-space tradeoffs of polynomial eval...
Abstract. An optimal (n2) lower bound is shown for the time-space product of any R-way branching pro...
AbstractTwo time-space tradeoffs for element distinctness are given. The first one shows T2S = Ω(n3)...
An optimal R(n2) lower bound is shown for the time-space product of any R-way branching pro-gram tha...
AbstractIt is shown how to extend the techniques originally used to prove a lower bound of Ω(n2) for...
AbstractThis paper establishes time-space tradeoffs for some algebraic problems in the branching pro...
AbstractExtending a result of Borodin et al. [1], we show that any branching program using linear qu...
AbstractWe obtain the first non-trivial time–space tradeoff lower bound for functions f:{0, 1}n→{0, ...
We obtain the first non-trivial time–space tradeoff lower bound for func-tions f: {0, 1}nQ {0, 1} on...
A longstanding open problem in complexity theory is whether the class Polytime (P) is the same as Lo...
Consider two types of instructions for manipulating disjoint sets. FIND(x) computes the name of the ...
We extend recent techniques for time-space tradeoff lower bounds using multiparty communication comp...
AbstractUpper bound time-space trade-offs are established for sorting and selection in two computati...
A model of computat ion is introduced which permits the analysis of both the time and space requirem...
We prove the first time-space lower bound tradeoffs for randomized computation of decision problems....
AbstractWe exhibit a new method for showing lower bounds for time-space tradeoffs of polynomial eval...
Abstract. An optimal (n2) lower bound is shown for the time-space product of any R-way branching pro...
AbstractTwo time-space tradeoffs for element distinctness are given. The first one shows T2S = Ω(n3)...
An optimal R(n2) lower bound is shown for the time-space product of any R-way branching pro-gram tha...
AbstractIt is shown how to extend the techniques originally used to prove a lower bound of Ω(n2) for...
AbstractThis paper establishes time-space tradeoffs for some algebraic problems in the branching pro...
AbstractExtending a result of Borodin et al. [1], we show that any branching program using linear qu...
AbstractWe obtain the first non-trivial time–space tradeoff lower bound for functions f:{0, 1}n→{0, ...
We obtain the first non-trivial time–space tradeoff lower bound for func-tions f: {0, 1}nQ {0, 1} on...
A longstanding open problem in complexity theory is whether the class Polytime (P) is the same as Lo...
Consider two types of instructions for manipulating disjoint sets. FIND(x) computes the name of the ...
We extend recent techniques for time-space tradeoff lower bounds using multiparty communication comp...
AbstractUpper bound time-space trade-offs are established for sorting and selection in two computati...
A model of computat ion is introduced which permits the analysis of both the time and space requirem...
We prove the first time-space lower bound tradeoffs for randomized computation of decision problems....
AbstractWe exhibit a new method for showing lower bounds for time-space tradeoffs of polynomial eval...