Denis Charles, A. Pavan, Samik Sengupta  Home/Search
Context
Related
| buffalo.edu/techreports...200011.ps.Z 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: buffalo.edu/techreports/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We study higher Arthur-Merlin classes defined via several natural probabilistic operators BP;R and co-R. We investigate the complexity classes they define, and a number of interactions between these operators and the standard polynomial time hierarchy. We prove a hierarchy theorem for these higher Arthur-Merlin classes involving interleaving operators, and a theorem giving non-trivial upper bounds to the intersection of the complementary classes in the hierarchy. 1 Introduction Arthur-Merlin ... (Update)
Similar documents (at the sentence level):
44.0%: On Higher Arthur-Merlin Classes - Charles, Pavan, Sengupta (Correct)
Active bibliography (related documents): More All
1.3: ... - Cai (Correct)
0.4: Polylogarithmic-round Interactive Proofs for coNP Collapse.. - Selman, Sengupta (2004) (Correct)
0.2: Observations on Measure and Lowness for Δ_2^p - Lutz (Correct)
Similar documents based on text: More All
0.4: Automatic Annotation and Retrieval of Images - Song, Wang (2002) (Correct)
0.2: Reductions between Disjoint NP-Pairs - Glaßer, Selman, Sengupta (Correct)
0.2: Unknown - (Correct)
BibTeX entry: (Update)
@techreport{ charles00higher,
author = "D. Charles and A. Pavan and S. Sengupta",
title = "On higher Arthur-Merlin classes",
number = "2000-11",
month = "12",
year = "2000",
url = "citeseer.ist.psu.edu/390604.html" }
Citations (may not include all citations):403 Proof verification and hardness of approximation problems - Arora, Lund et al. - 1992
242 Nondeterministic exponential time has twoprover interactive .. - B'abai, Fortnow et al. - 1991
172 Algebraic Methods for Interactive Proof Systems - Lund, Fortnow et al. - 1992
155 Checking computations in polylogarithmic time - B'abai, Fortnow et al. - 1991
126 PP is as hard as polynomial-time hierarchy (context) - Toda - 1991
98 Private coins versus public coins in interactive proof syste.. (context) - Goldwasser, Sipser - 1986
88 The Knowledge Complexity of Interactive Proofs (context) - Goldwasser, Micali et al. - 1985
87 Arthur-Merlin Games : a randomized proof system (context) - B'abai, Moran - 1988
83 Multiprover interactive proofs: How to remove the intractabi.. (context) - Ben-Or, Goldwasser et al. - 1988
73 Does co-NP have short interactive proofs (context) - Boppana, Hastad et al. - 1987
65 Journal of the ACM (context) - Shamir, PSPACE - 1992
57 Oracles and Queries that are sufficient for Exact Learning - Bshouty, Cleve et al. - 1994
30 The complexity of finding middle elements - Vollmer, Wagner - 1993
23 Approximating clique is NP-complete (context) - Arora, Safra - 1992
18 Complexity classes of optimization functions - Vollmer, Wagner - 1995
17 Another Proof that BPP ` PH (context) - Goldreich, Zuckerman - 1997
15 Polynomial time 1-Turing reductions from #PH to #P (context) - Watanabe, Toda - 1992
14 A Decisive characterization of BPP (context) - Zachos, Heller - 1986
13 th Annual Symposium on Foundations of Computer Science (context) - Agrawal, Thierauf et al.
12 A complexity theory for closure properties (context) - Ogihara, Hemachandra - 1993
8 The Operators min and max on the Polynomial Hierarchy (context) - Hempel, Wechsung - 2000
5 New collapse consequences of NP having small circuits ICALP - Kobler, Watanabe - 1995
4 Graph isomorphism is low for ZPP NP and other lowness result.. - Arvind, Kobler - 2000
3 th FST and TCS (context) - Arvind, Kobler et al. - 1997
3 Trading group theory for randomness (context) - B'abai
2 Aprroximating clique is akmost NP-complete (context) - Feige, Goldwasser et al. - 1991
2 Probabilistic quantifiers vs Distrustful adversaries (context) - Zachos, Furer - 1987
2 th Conf on computational Complexity (context) - Vollmer, Wagner et al. - 1997
Documents on the same site (http://www.cs.buffalo.edu/tech-reports/): More
A Knowledge-Based Approach To Deriving Logical Structure From.. - Niyogi (1994) (Correct)
A Model of Image Representation and Indexing in Image.. - Sheikholeslami, Wang.. (Correct)
An Overview of Run-length Encoding of Handwritten Word Images - Slavik, Govindaraju (2000) (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