15155 search results - page 344 / 3031 » System Software |
161
click to vote
TIC
1998
Springer
15 years 11 months ago
1998
Springer
Suppose we translate two different source languages,
154
click to vote
CC
2010
Springer
15 years 6 months ago
2010
Springer
We solve an open problem in communication complexity posed by Kushilevitz and Nisan (1997). Let R (f) and D
183
click to vote
CC
2006
Springer
15 years 6 months ago
2006
Springer
We improve upon indirect diagonalization arguments for lower bounds on explicit problems within the polynomial hierarchy. Our contributions are summarized as follows.
175
click to vote
CC
2005
Springer
15 years 6 months ago
2005
Springer
Let (n) be the minimum number of arithmetic operations required to build the integer n N from the constants 1 and 2. A sequence xn is said to be "easy to compute" if the...