Computational Complexity and Feasibility of Data Processing and Interval Computations, With Extension to Cases When We Have Partial Information about Probabilities (2003)

Cached

Download Links

by Vladik Kreinovich , Luc Longpre
Citations:191 - 118 self

Active Bibliography

6 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
32 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 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
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
5 Measure One Results In Computational Complexity Theory – Heribert Vollmer, Klaus W. Wagner - 1997
7 Weakly Complete Problems are Not Rare – David W. Juedes - 1995
1 Hard Sets Are Hard to Find – H. Buhrman, D. Van Melkebeek - 1998
27 NP-hard Sets are P-Superterse Unless R = NP – Richard Beigel - 1992
10 The Power Of Interaction – Carsten Lund - 1991