179 search results - page 16 / 36 » eccc 2010 |
ECCC
2010
13 years 7 months ago
2010
We give two time- and space-efficient simulations of quantum computations with intermediate measurements, one by classical randomized computations with unbounded error and the oth...
ECCC
2010
13 years 7 months ago
2010
We investigate the complexity of the following computational problem: Polynomial Entropy Approximation (PEA): Given a low-degree polynomial mapping p : Fn Fm , where F is a finite...
ECCC
2010
13 years 7 months ago
2010
We prove that the pseudorandom generator introduced in [INW94] fools group products of a given finite group. The seed length is O(log n log 1 ), where n the length of the word and...
ECCC
2010
13 years 6 months ago
2010
We initiate the study of the proof complexity of propositional encoding of (weak cases of) concrete independence results. In particular we study the proof complexity of Paris-Harr...
ECCC
2010
13 years 2 months ago
2010
The hybrid argument allows one to relate the distinguishability of a distribution (from uniform) to the predictability of individual bits given a prefix. The argument incurs a los...