Peter Bro Miltersen, N.V. Vinodchandran  Home/Search
Context Related
| brics.dk/~vinod/papers/FocsFinal.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: brics.dk/~vinod/papers/index (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We prove that AM (and hence Graph Nonisomorphism) is in NP if for some > 0, some language in NE \ coNE requires nondeterministic circuits of size 2 n . This improves recent results of Arvind and K obler and of Klivans and Van Melkebeek who proved the same conclusion, but under stronger hardness assumptions, namely, either the existence of a language in NE \ coNE which cannot be approximated by nondeterministic circuits of size less than 2 n or the existence of a language in NE \ coNE... (Update)
Cited by: More
Nonuniform Hard Boolean Functions and Uniform Complexity Classes - Kabanets (2001) (Correct)
Lower Bounds for Non-Black-Box Zero Knowledge - Barak, Lindell, Vadhan (2004) (Correct)
List-Decoding of Linear Functions and Analysis of a.. - Dwork, Shaltiel.. (Correct)
Similar documents (at the sentence level):
58.4%: Derandomizing Arthur-Merlin Games using Hitting Sets - Miltersen, Variyam (1999) (Correct)
Active bibliography (related documents): More All
0.4: Graph Nonisomorphism Has Subexponential Size Proofs.. - Klivans, van Melkebeek (1998) (Correct)
0.3: Recent Advances Towards Proving P=BPP - Clementi, Rolim, Trevisan (1998) (Correct)
0.3: Extractors and Pseudorandom Generators - Trevisan (2000) (Correct)
Similar documents based on text: More All
0.7: Pseudorandom generators without the XOR Lemma - Sudan, Trevisan, Vadhan (2000) (Correct)
0.3: One-sided Versus Two-sided Randomness - Buhrman, Fortnow (1998) (Correct)
0.3: One-sided Versus Two-sided Error in Probabilistic Computation - Buhrman, Fortnow (1999) (Correct)
Related documents from co-citation: More All
12: Graph nonisomorphism has subexponential size proofs unless the polynomial-time h.. - Klivans, van Melkebeek - 1998
10: Pseudorandom generators without the XOR lemma - Sudan, Trevisan et al. - 1998
10: requires exponential circuits: Derandomizing the XOR lemma (context) - Impagliazzo, Wigderson et al. - 1997
BibTeX entry: (Update)
Peter Bro Miltersen and N.V. Vinodchandran. Derandomizing Arthur--Merlin games using hitting sets. In 40th Annual Symposium on Foundations of Computer Science, New York, NY, 17--19 October 1999. IEEE. 11 http://citeseer.ist.psu.edu/miltersen99derandomizing.html More
@inproceedings{ miltersen99derandomizing,
author = "Peter Bro Miltersen and N. V. Vinodchandran",
title = "Derandomizing Arthur-Merlin Games Using Hitting Sets",
booktitle = "{IEEE} Symposium on Foundations of Computer Science",
pages = "71-80",
year = "1999",
url = "citeseer.ist.psu.edu/miltersen99derandomizing.html" }
Citations (may not include all citations):339 Theory and application of trapdoor functions (context) - Yao - 1982
334 How to generate cryptographically strong sequences of pseudo.. (context) - Blum, Micali - 1984
194 Proofs that yield nothing but their validity or all language.. (context) - Goldreich, Micali et al. - 1991
173 Trading group theory for randomness (context) - Babai - 1985
155 Checking computations in polylogarithmic time - Babai, Fortnow et al. - 1991
149 A hardcore predicate for all one-way functions (context) - Goldreich, Levin - 1989
98 Private coins versus public coins in interactive proof syste.. (context) - Goldwasser, Sipser - 1989
87 Arthur-Merlin games: a randomized proof system (context) - Babai, Moran - 1988
83 BPP has subexponential time simulations unless EXPTIME has p.. - Babai, Fortnow et al. - 1993
69 requires exponential circuits: Derandomizing the XOR lemma (context) - Impagliazzo, Wigderson et al. - 1997
68 Hardness vs randomness (context) - Nisan, Wigderson - 1994
64 Pseudorandom generators without the XOR lemma - Sudan, Trevisan et al. - 1999
44 Relativized circuit complexity (context) - Wilson - 1985
42 Hard-core distributions for somewhat hard problems - Impagliazzo - 1995
39 On completeness and soundness in interactive proof systems - Furer, Goldreich et al. - 1989
28 or time versus space (context) - Sipser, randomness - 1988
26 Canonical labeling of graphs (context) - Babai, Luks - 1983
23 On resourcebounded measure and pseudorandomness (context) - Arvind, Kobler - 1997
20 Weak random sources (context) - Andreev, Clementi et al. - 1997
19 Almost optimal dispersers - Ta-Shma - 1998
19 A new general derandomization method (context) - Andreev, Clementi et al. - 1998
16 Explicit OR-dispersers with polylogarithmic degree - Saks, Srinivasan et al. - 1998
15 and deterministic dynamic dictionaries (context) - Miltersen, codes et al. - 1998
14 Computational complexity and the classification of finite si.. (context) - Babai, Kantor et al. - 1983
13 Hitting sets derandomize BPP (context) - Andreev, Clementi et al. - 1996
11 Much ado about functions - Selman - 1996
10 One-sided versus two-sided error in probabilistic computatio.. - Buhrman, Fortnow - 1999
8 Bounded round interactive proofs in finite groups (context) - Babai - 1992
7 Graph nonisomorhism has subexponential size proofs unless th.. (context) - Klivans, van Melkebeek - 1999
3 Hitting properties of hard boolean operators and their conse.. (context) - Andreev, Clementi et al. - 1996
3 Derandomizing ArthurMerlin games - van Melkebeek - 1998
2 Number 22 in EATCS Monographs on Theoretical Computer Scienc.. (context) - Balcazar, Daz et al. - 1990
2 Computational Complexity (context) - Papadimitriou - 1994
2 Constructions of near-optimal extractros using pseudo-random.. (context) - Trevisan - 1999
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.brics.dk/~vinod/papers/index.html): More
Super-Polynomial versus Half-Exponential Circuit.. - Miltersen.. (1999) (Correct)
Improved Lowness Results for Solvable Black-box Group Problems - Vinodchandran (1997) (Correct)
The Query Complexity of Program Checking by.. - Arvind.. (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