dblp.uni-trier.dewww.dagstuhl.dewww.uni-trier.de

Joan Feigenbaum (Selection)

List of publications from the DBLP Bibliography Server - FAQ
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo


38Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAnne Condon, Joan Feigenbaum, Carsten Lund, Peter W. Shor: Random Debaters and the Hardness of Approximating Stochastic Functions. SIAM J. Comput. 26(2): 369-400 (1997)
32no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJoan Feigenbaum, Daphne Koller, Peter W. Shor: A Game-Theoretic Classification of Interactive Complexity Classes. Structure in Complexity Theory Conference 1995: 227-237
31Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAnne Condon, Joan Feigenbaum, Carsten Lund, Peter W. Shor: Probabilistically Checkable Debate Systems and Nonapproximability of PSPACE-Hard Functions. Chicago J. Theor. Comput. Sci. 1995: (1995)
30no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAnne Condon, Joan Feigenbaum, Carsten Lund, Peter W. Shor: Random Debaters and the Hardness of Approximating Stochastic Functions. Structure in Complexity Theory Conference 1994: 280-293
28Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAnne Condon, Joan Feigenbaum, Carsten Lund, Peter W. Shor: Probabilistically checkable debate systems and approximation algorithms for PSPACE-hard functions. STOC 1993: 305-314

Selection of 5 from 118 records - Joan Feigenbaum has 108 coauthors

Last update 2012-09-10 CET by the DBLP TeamThis material is Open Data Content released under the ODC-BY 1.0 license — See also our legal information page