![]() | ![]() |
| 1999 | ||
|---|---|---|
| 2 | Alexander E. Andreev, Juri L. Baskakov, Andrea E. F. Clementi, José D. P. Rolim: Small Pseudo-Random Sets Yield Hard Functions: New Tight Explict Lower Bounds for Branching Programs. ICALP 1999: 179-189 | |
| 1997 | ||
| 1 | Alexander E. Andreev, Juri L. Baskakov, Andrea E. F. Clementi, José D. P. Rolim: Small Random Sets for Affine Spaces and Better Explicit Lower Bounds for Branching Programs Electronic Colloquium on Computational Complexity (ECCC) 4(53): (1997) | |
| 1 | Alexander E. Andreev | [1] [2] |
| 2 | Andrea E. F. Clementi | [1] [2] |
| 3 | José D. P. Rolim | [1] [2] |
Data released under the ODC-BY 1.0 license — See also our legal information page