AbstractIt is shown how to extend the techniques originally used to prove a lower bound of Ω(n2) for the product of the time and space consumed for sorting in branching programs with elementary comparisons, to the case of linear branching programs where linear functions on n input elements can be computed in unit time
We prove the first time-space lower bound tradeoffs for randomized computation of decision problems....
A longstanding open problem in complexity theory is whether the class Polytime (P) is the same as Lo...
AbstractA model of computation is introduced which permits the analysis of both the time and space r...
AbstractIt is shown how to extend the techniques originally used to prove a lower bound of Ω(n2) for...
AbstractExtending a result of Borodin et al. [1], we show that any branching program using linear qu...
Abstract. An optimal (n2) lower bound is shown for the time-space product of any R-way branching pro...
An optimal R(n2) lower bound is shown for the time-space product of any R-way branching pro-gram tha...
AbstractWe obtain the first non-trivial time–space tradeoff lower bound for functions f:{0, 1}n→{0, ...
AbstractUpper bound time-space trade-offs are established for sorting and selection in two computati...
We study the fundamental problem of sorting in a sequential model of computation and in particular c...
We obtain the first non-trivial time–space tradeoff lower bound for func-tions f: {0, 1}nQ {0, 1} on...
A model of computation is introduced which permits the analysis of both the time and space require-m...
AbstractThis paper establishes time-space tradeoffs for some algebraic problems in the branching pro...
A model of computat ion is introduced which permits the analysis of both the time and space requirem...
AbstractThis paper considers time-space tradeoffs for various set operations. Denoting the time requ...
We prove the first time-space lower bound tradeoffs for randomized computation of decision problems....
A longstanding open problem in complexity theory is whether the class Polytime (P) is the same as Lo...
AbstractA model of computation is introduced which permits the analysis of both the time and space r...
AbstractIt is shown how to extend the techniques originally used to prove a lower bound of Ω(n2) for...
AbstractExtending a result of Borodin et al. [1], we show that any branching program using linear qu...
Abstract. An optimal (n2) lower bound is shown for the time-space product of any R-way branching pro...
An optimal R(n2) lower bound is shown for the time-space product of any R-way branching pro-gram tha...
AbstractWe obtain the first non-trivial time–space tradeoff lower bound for functions f:{0, 1}n→{0, ...
AbstractUpper bound time-space trade-offs are established for sorting and selection in two computati...
We study the fundamental problem of sorting in a sequential model of computation and in particular c...
We obtain the first non-trivial time–space tradeoff lower bound for func-tions f: {0, 1}nQ {0, 1} on...
A model of computation is introduced which permits the analysis of both the time and space require-m...
AbstractThis paper establishes time-space tradeoffs for some algebraic problems in the branching pro...
A model of computat ion is introduced which permits the analysis of both the time and space requirem...
AbstractThis paper considers time-space tradeoffs for various set operations. Denoting the time requ...
We prove the first time-space lower bound tradeoffs for randomized computation of decision problems....
A longstanding open problem in complexity theory is whether the class Polytime (P) is the same as Lo...
AbstractA model of computation is introduced which permits the analysis of both the time and space r...
DOI
Add to ORKG