Dieter van Melkebeek  Home/Search
Context
Related
| uchicago.edu/~diete...sparsejcss.ps.gz uchicago.edu/~diete...sparsejcss.ps.gz rutgers.edu/~dieter/Pa...sparsejcss.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: uchicago.edu/~dieter/Papers/ (more) From: uchicago.edu/~dieter/Papers/ (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We prove that there is no sparse hard set for P under logspace computable bounded truthtable reductions unless P = L. In case of reductions computable in NC 1 , the collapse goes down to P = NC 1 . We parameterize this result and obtain a generic theorem allowing to vary the sparseness condition, the space bound and the number of queries of the truth-table reduction. Another instantiation yields that there is no quasipolynomially dense hard set for P under polylogspace computable... (Update)
Similar documents (at the sentence level):
65.4%: Deterministic and Randomized Bounded Truth-table Reductions of .. - van Melkebeek (1996) (Correct)
11.2%: Reducing P to a Sparse Set using a Constant Number of Queries.. - van Melkebeek (1996) (Correct)
Active bibliography (related documents): More All
0.5: Probabilistic Techniques In Structural Complexity Theory - Sivakumar (1996) (Correct)
0.5: Sparse Hard Sets for P - van Melkebeek, Ogihara (1997) (Correct)
0.5: On the Existence of Hard Sparse Sets under Weak Reductions - Cai, Naik, Sivakumar (1996) (Correct)
Similar documents based on text: More All
1.5: Sparse Hard Sets for P: Resolution of a Conjecture of Hartmanis - Cai, Sivakumar (Correct)
1.2: Resolution of Hartmanis' Conjecture for NL-Hard Sparse Sets - Cai, Sivakumar (1995) (Correct)
0.8: A Moment of Perfect Clarity II: Consequences of Sparse.. - Glaßer, Hemaspaandra (2000) (Correct)
BibTeX entry: (Update)
@techreport{ vanmelkebeek96deterministic,
author = "Dieter van Melkebeek",
title = "Deterministic and Randomized Bounded Truth-table Reductions of{P}, {NL}, and {L} to Sparse Sets",
number = "96-39",
month = "11,",
year = "1996",
url = "citeseer.ist.psu.edu/16426.html" }
Citations (may not include all citations):860 The Theory of Error-Correcting Codes (context) - MacWilliams, Sloane - 1981
170 Nondeterministic space is closed under complementation - Immerman - 1988
168 A taxonomy of problems with fast parallel algorithms (context) - Cook - 1985
163 NP is as easy as detecting unique solutions (context) - Valiant, Vazirani - 1986
149 A hard-core predicate for all one-way functions (context) - Goldreich, Levin - 1989
128 Simple constructions of almost k-wise independent random var.. - Alon, Goldreich et al. - 1990
126 On isomorphism and density of NP and other complete sets (context) - Berman, Hartmanis - 1977
90 Introduction to Coding Theory (context) - van Lint - 1991
70 Sparse complete sets for NP: Solution of a conjecture of Ber.. (context) - Mahaney - 1982
65 The circuit value problem is log-space complete for P (context) - Ladner - 1975
58 volume 11 of EATCS Monographs on Theoretical Computer Scienc.. (context) - Balc, az et al. - 1995
54 Fast parallel matrix and GCD computations (context) - Borodin, Gathen et al. - 1982
53 A fast parallel algorithm to compute the rank of a matrix ov.. (context) - Mulmuley - 1987
49 On polynomial-time bounded truth-table reducibility of NP se.. - Ogiwara, Watanabe - 1991
42 The method of forced enumeration for nondeterministic automa.. (context) - Szelepcs - 1988
33 On log-tape isomorphisms of complete sets (context) - Hartmanis - 1978
29 Problems complete for deterministic logarithmic space (context) - Cook, McKenzie - 1987
25 On reductions of NP sets to sparse sets (context) - Homer, Longpr - 1994
21 The resolution of a Hartmanis conjecture - Cai, Sivakumar - 1995
20 the existence of hard sparse sets under weak reductions - Cai, Naik et al. - 1996
18 and randomized reductions to sparse sets (context) - Arvind, bler et al. - 1992
16 On randomized reductions to sparse sets (context) - Ranjan, Rohatgi - 1992
16 On one-query self-reducible sets (context) - Ogiwara, Lozano - 1991
15 Maze recognizing automata and nondeterministic tape complexi.. (context) - Savitch - 1973
9 multiple access to randomness in logspace (context) - Nisan, vs - 1993
7 Resolution of Hartmanis' conjecture for NL-hard sparse sets - Cai, Sivakumar - 1995
5 Very fast parallel polynomial arithmetic (context) - Eberly - 1989
5 On some deterministic space complexity problems (context) - Hong - 1980
4 Mathematical Systems Theory (context) - Wilson - 1987
3 Bounded truth-table reductions of P - Cai, Naik et al. - 1995
2 hard sets yield space-eOEcient algorithms (context) - Ogihara - 1995
1 Small-bias probability spaces: eOEcient constructions and ap.. (context) - Naor, Naor - 1990
Documents on the same site (http://cs-www.uchicago.edu/~dieter/Papers/): More
Separating Complexity Classes using Autoreducibility - Buhrman, Fortnow, van.. (1998) (Correct)
Graph Nonisomorphism Has Subexponential Size Proofs.. - Klivans, van Melkebeek (1998) (Correct)
Derandomizing Arthur-Merlin Games - van Melkebeek (1998) (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