AbstractTwo time-space tradeoffs for element distinctness are given. The first one shows T2S = Ω(n3) on a branching program using minimum operations. By a result of Yao (1982), this implies the same bounds for linear queries. The second result extends one by Duris and Galil (1984) who constructed a Boolean function that requires T2S = Ω(n3) on a k-headed Turing machine. Here it is shown that their proof also holds for element distinctness, a more natural problem
We obtain the first non-trivial time–space tradeoff lower bound for func-tions f: {0, 1}nQ {0, 1} on...
AbstractOur computational model is a random access machine with n read only input registers each con...
We extend recent techniques for time-space tradeoff lower bounds using multiparty communication comp...
AbstractThis paper considers time-space tradeoffs for various set operations. Denoting the time requ...
We derive new time-space tradeoff lower bounds and algorithms for exactly computing statistics of in...
Abstract. An optimal (n2) lower bound is shown for the time-space product of any R-way branching pro...
It is shown that the Element Distinctness Problem (n numbers of k log n bits each, k 2) on a one-t...
AbstractThis paper establishes time-space tradeoffs for some algebraic problems in the branching pro...
Abstract — We derive new time-space tradeoff lower bounds and algorithms for exactly computing stati...
An optimal R(n2) lower bound is shown for the time-space product of any R-way branching pro-gram tha...
Given a list of n integers, the problem of element distinctness is to determine if the list has dist...
AbstractExtending a result of Borodin et al. [1], we show that any branching program using linear qu...
AbstractIt is shown how to extend the techniques originally used to prove a lower bound of Ω(n2) for...
We prove the first time-space lower bound tradeoffs for randomized computation of decision problems....
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...
AbstractOur computational model is a random access machine with n read only input registers each con...
We extend recent techniques for time-space tradeoff lower bounds using multiparty communication comp...
AbstractThis paper considers time-space tradeoffs for various set operations. Denoting the time requ...
We derive new time-space tradeoff lower bounds and algorithms for exactly computing statistics of in...
Abstract. An optimal (n2) lower bound is shown for the time-space product of any R-way branching pro...
It is shown that the Element Distinctness Problem (n numbers of k log n bits each, k 2) on a one-t...
AbstractThis paper establishes time-space tradeoffs for some algebraic problems in the branching pro...
Abstract — We derive new time-space tradeoff lower bounds and algorithms for exactly computing stati...
An optimal R(n2) lower bound is shown for the time-space product of any R-way branching pro-gram tha...
Given a list of n integers, the problem of element distinctness is to determine if the list has dist...
AbstractExtending a result of Borodin et al. [1], we show that any branching program using linear qu...
AbstractIt is shown how to extend the techniques originally used to prove a lower bound of Ω(n2) for...
We prove the first time-space lower bound tradeoffs for randomized computation of decision problems....
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...
AbstractOur computational model is a random access machine with n read only input registers each con...
We extend recent techniques for time-space tradeoff lower bounds using multiparty communication comp...
DOI
Add to ORKG