Jörg Rothe  Home/Search
Context Related
| wi.euvfrankfurto.de/icci94/pa...a6.ps viadrina.euvfrankfurto.de/~wi...a6.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: wi.euvfrankfurto.de/icci...absa (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: In this paper, an open problem raised by Toda and Ogiwara [TO92] is reformulated in the context of promise problems to make precise its very nature--- thereby answering it partially---which, by intuition, is due to the promise in the definition of SPP [FFK91, OH90]. In particular, it is shown that the polynomial hierarchy is contained in a promise class that naturally corresponds to the class BP \Delta SPP (even though for this class itself, unfortunately, the original problem remains... (Update)
Context of citations to this paper: More
.... corollaries from the following strong lemma [Gup91] 8 As it is here stated in a slightly more general setting, the reader is referred to [Rot94] for a formal proof of Lemma 3.3, which will be central to the proof of Theorem 3.4. An interesting open problem is whether...
Cited by: More
A Promise Class at Least as Hard as the Polynomial Hierarchy - Rothe (1994) (Correct)
Active bibliography (related documents): More All
0.6: Gap-Definable Counting Classes - Fenner, Fortnow, Kurtz (1992) (Correct)
0.6: Raising NP Lower Bounds to Parallel NP Lower Bounds - Hemaspaandra, Hemaspaandra.. (1997) (Correct)
0.5: Selectivity: Reductions, Nondeterminism, and Function.. - Hemaspaandra, Hoene.. (1993) (Correct)
Similar documents based on text: More All
0.2: On Bounden-Probability Operators and ... - Gupta (1992) (Correct)
0.2: On Some Promise Classes in Structural Complexity Theory - Rothe (Correct)
0.2: Complexity-Theoretic Analogs of Rice's Theorem - Hemaspaandra, Rothe (1997) (Correct)
BibTeX entry: (Update)
J. Rothe. A promise class at least as hard as the polynomial hierarchy. Technical Report TR 484, University of Rochester, Rochester, NY, January 1994. http://citeseer.ist.psu.edu/article/rothe94promise.html More
@techreport{ rothe94promise,
author = "J{\"o}rg Rothe",
title = "A Promise Class at Least as Hard as the Polynomial Hierarchy",
number = "TR484",
year = "1994",
url = "citeseer.ist.psu.edu/article/rothe94promise.html" }
Citations (may not include all citations):1911 Introduction to Automata Theory (context) - Hopcroft, Ullman - 1979
163 The complexity of enumeration and reliability problems (context) - Valiant - 1979
163 NP is as easy as detecting unique solutions (context) - Valiant, Vazirani - 1986
145 Computational complexity of probabilistic Turing machines (context) - Gill - 1977
129 Theoretical Computer Science (context) - Stockmeyer, hierarchy - 1977
122 A comparison of polynomial time reducibilities (context) - Ladner, Lynch et al. - 1975
90 The complexity of combinatorial problems with succinct input.. (context) - Wagner - 1986
86 Gap-definable counting classes - Fenner, Fortnow et al. - 1991
64 The equivalence problem for regular expressions with squarin.. (context) - Meyer, Stockmeyer - 1972
56 Information Processing Letters (context) - Valiant, complexity et al. - 1976
55 On Some Central Problems in Computational Complexity (context) - Simon - 1975
53 SIAM Journal on Computing (context) - Baker, Gill et al. - 1975
53 Counting classes are at least as hard as the polynomial-time.. (context) - Toda, Ogiwara - 1992
45 Two remarks on the power of counting (context) - Papadimitriou, Zachos - 1983
44 The Graph Isomorphism Problem: Its Structural Complexity (context) - Kobler, Schoning et al. - 1993
30 the construction of parallel computers from various bases of.. (context) - Goldschlager, Parberry - 1986
26 A survey on counting classes (context) - Gundermann, Nasser et al. - 1990
18 Computational Complexity of Counting Complexity Classes (context) - Toda - 1991
13 Structural Properties of Counting Hierarchies (context) - Tor'an - 1988
12 and the polynomial hierarchy (context) - Tarui, threshold - 1991
11 Unambiguous Computation: Boolean hierarchies and sparse Turi.. - Hemaspaandra, Rothe - 1994
8 Promise problems complete for complexity classes (context) - Selman - 1988
7 The power of witness reduction (context) - Gupta - 1991
6 Cryptocomplexity and NP-completeness (context) - Even, Yacobi - 1980
5 Promises and fault-tolerant database access (context) - Cai, Hemachandra et al. - 1993
4 Extended locally definable acceptance types (context) - Niedermeier, Rossmanith - 1993
2 Some closure properties of gap-definable classes (context) - Rothe - 1993
2 Gap-definability as a closure property - Fenner, Fortnow et al. - 1993
1 On closure properties of bounded 2-sided error complexity cl.. - Regan, Royer - 1991
1 A promise class at least as hard as the polynomial hierarchy - Rothe - 1994
1 A note on the polynomial-time hierarchy and probabilistic op.. (context) - Rothe, Vogel - 1992
1 Recent highlights in structural complexity theory (context) - Schoning - 1991
Documents on the same site (http://www.wi.euv-frankfurt-o.de/icci94/absa.htm): More
Dynamic Subtrees: a New Data Structure for Manipulating Trees - Xu (1994) (Correct)
BIPARTITIONING into OVERLAPPING sets - Haralambides, Tragoudas (1994) (Correct)
An Optimal Resolution Sensitive Pyramid Representation for.. - Nardelli, Proietti (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC