| |
| 2002 | ||
|---|---|---|
| 6 | Stephen Bellantoni, Martin Hofmann: A New "Feasible" Arithmetic. J. Symb. Log. 67(1): 104-116 (2002) | |
| 1994 | ||
| 5 | Stephen Bellantoni: Characterizing Parallel Time by Type 2 Recursions With Polynomial Output Length. LCC 1994: 253-268 | |
| 1992 | ||
| 4 | Stephen Bellantoni, Stephen A. Cook: A New Recursion-Theoretic Characterization of the Polytime Functions (Extended Abstract) STOC 1992: 283-293 | |
| 3 | Stephen Bellantoni, Stephen A. Cook: A New Recursion-Theoretic Characterization of the Polytime Functions. Computational Complexity 2: 97-110 (1992) | |
| 2 | Stephen Bellantoni, Toniann Pitassi, Alasdair Urquhart: Approximation and Small-Depth Frege Proofs. SIAM J. Comput. 21(6): 1161-1179 (1992) | |
| 1991 | ||
| 1 | Stephen Bellantoni, Toniann Pitassi, Alasdair Urquhart: Approximation and Small Depth Frege Proofs. Structure in Complexity Theory Conference 1991: 367-390 | |
| 1 | Stephen A. Cook | [3] [4] |
| 2 | Martin Hofmann | [6] |
| 3 | Toniann Pitassi | [1] [2] |
| 4 | Alasdair Urquhart | [1] [2] |