Searching for authors named "Andrej Bogdanov" – sorted by Relevance.
-
Gap amplification fails below 1/2
- Gap Amplification Fails Below 1/2 Andrej Bogdanov June 1, 2005 Abstract The gap amplification
- Cited by 3 (0 self) – Add To MetaCart
-
Pseudorandom generators for low degree polynomials
- Pseudorandom generators for low degree polynomials Andrej Bogdanov ∗ March 3, 2005 Abstract We
- Cited by 7 (0 self) – Add To MetaCart
-
Lower Bounds for Testing Bipartiteness in Dense Graphs
- Lower Bounds for Testing Bipartiteness in Dense Graphs Andrej Bogdanov # Luca Trevisan + November
- Cited by 8 (0 self) – Add To MetaCart
-
A stateful implementation of a random function supporting parity queries over hypercubes
- A stateful implementation of a random function supporting parity queries over hypercubes Andrej
- Cited by 1 (0 self) – Add To MetaCart
-
Hardness Amplification for Errorless Heuristics
- Hardness Amplification for Errorless Heuristics Andrej Bogdanov ∗ Muli Safra † August 10, 2007
- Add To MetaCart
-
Pseudorandom bits for polynomials
- Pseudorandom bits for polynomials Andrej Bogdanov ∗ Emanuele Viola † August 10, 2007 Abstract We
- Cited by 8 (4 self) – Add To MetaCart
-
On worst-case to average-case reductions for NP problems
- On Worst-Case to Average-Case Reductions for NP Problems Andrej Bogdanov ∗ Luca Trevisan † January
- Cited by 28 (4 self) – Add To MetaCart
-
Average-Case Complexity
- . Bogdanov and L. Trevisan DOI: 10.1561/0400000004 Average-Case Complexity Andrej Bogdanov 1 and Luca
- Cited by 3 (0 self) – Add To MetaCart
-
On Worst-Case to Average-Case Reductions for NP Problems
- On Worst-Case to Average-Case Reductions for NP Problems Andrej Bogdanov Computer Science Division
- Add To MetaCart
-
The Complexity of Distinguishing Markov Random Fields
- The Complexity of Distinguishing Markov Random Fields Andrej Bogdanov1⋆ , Elchanan Mossel2
- Add To MetaCart

