|
7
|
Fast Quantum Algorithms for Handling Probabilistic and Interval Uncertainty
– Vladik Kreinovich, Luc Longpre
- 2003
|
|
|
Computable p-adic Numbers
– George Kapoulas, George Kapoulas
- 1999
|
|
|
About and Around Computing Over the Reals
– Solomon Feferman
|
|
21
|
Algorithmic Theories Of Everything
– Jürgen Schmidhuber
- 2000
|
|
|
Probabilistic Type-2 Operators and "Almost"-Classes
– Ronald V. Book, Heribert Vollmer, Klaus W. Wagner
- 1998
|
|
|
Circuit Lower Bounds Collapse Relativized Complexity Classes
– Richard Beigel, Alexis Maciel
- 1998
|
|
|
Comparing Notions of Full Derandomization
– Lance Fortnow Nec, Lance Fortnow
- 2001
|
|
10
|
Complex Fourier Technique for Lower Bounds on the Mod-m Degree
– Frederic Green
|
|
9
|
On the Cutting Edge of Relativization: The Resource Bounded Injury Method
– Harry Buhrman, Leen Torenvliet
- 1994
|
|
4
|
Strong Self-Reducibility Precludes Strong Immunity
– Lane A. Hemaspaandra, Marius Zimand
- 1995
|
|
6
|
An Upward Measure Separation Theorem
– Jack Lutz
- 1991
|
|
10
|
Bi-immunity Results for Cheatable Sets
– Richard Beigel
- 1995
|
|
1
|
Generic Separations and Leaf Languages
– Alle Rechte Vorbehalten, Matthias Galota, Matthias Galota, Sven Kosub, Sven Kosub, Heribert Vollmer, Heribert Vollmer
- 2001
|
|
1
|
When are k+1 Queries Better Than k?
– Richard Beigel
- 1995
|
|
4
|
High Sets for NP
– Johannes Köbler, Uwe Schöning
- 1997
|
|
1
|
A Note on Independent Random Oracles
– Jack H. Lutz
- 1992
|
|
9
|
Closure Properties and Witness Reduction
– Sanjay Gupta, Sanjay Gupta
- 1995
|
|
1
|
On the Robustness of ALMOST-R
– Ronald V. Book, Elvira Mayordomo
- 1996
|
|
8
|
Sets Computable in Polynomial Time on Average
– Rainer Schuler, Tomoyuki Yamakami
- 1995
|
