See this document in CiteSeerX!

Oracle Separation of Complexity Classes and Lower Bounds for Perceptrons Solving Separation Problems  (Make Corrections)  
Nikolai Vereshchagin



  Home/Search   Context   Related

 
View or download:
lpcs.math.msu.ru/~ver/pap...oraclize.ps
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  lpcs.math.msu.ru/~ver/publenc (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: In the first part of the paper we prove that, relative to a random oracle, the class NP has infinite sets having no infinite Co-NP-subsets (Co-NP-immune sets). (Update)

Similar documents (at the sentence level):
41.2%:   Lower Bounds for Perceptrons Solving some Separation Problems.. - Vereshchagin (1988)   (Correct)
18.0%:   NP-sets are Co-NP-immune Relative to a Random Oracle - Vereshchagin (1994)   (Correct)

Active bibliography (related documents):   More   All
0.6:   Perceptrons, PP, And The Polynomial Hierarchy - Beigel (1992)   (Correct)
0.5:   A General Method to Construct Oracles Realizing Given.. - Muchnik, Vereshchagin (1994)   (Correct)
0.5:   Extremal Properties of Polynomial Threshold Functions - O'Donnell, Servedio (2003)   (Correct)

Similar documents based on text:   More   All
0.8:   Relationships between NP-sets, Co-NP-sets, and P-sets relative .. - Vereshchagin   (Correct)
0.4:   A Lower Bound for Perceptrons and an Oracle Separation of the.. - Berg, Ulfberg (1997)   (Correct)
0.4:   Relativizable And Nonrelativizable Theorems In The Polynomial.. - Vereshchagin (1993)   (Correct)

BibTeX entry:   (Update)

@misc{ vereshchagin-oracle,
  author = "Nikolai Vereshchagin",
  title = "Oracle Separation of Complexity Classes and Lower Bounds for Perceptrons
    Solving Separation Problems",
  url = "citeseer.ist.psu.edu/494200.html" }
Citations (may not include all citations):
482   Combinatorial Optimization: Algorithms and Complexity (context) - Papadimitriou, Steiglitz - 1982
84   Mathematical Systems Theory (context) - Furst, Saxe et al. - 1984
66   PP is closed under intersection - Beigel, Reingold et al. - 1991
53   SIAM Journal on Computing (context) - Baker, Gill et al. - 1975
38   PP is closed under truth table reductions - Fortnow, Reingold - 1991
33   Problems and Theorems in Analysis (context) - P'olya, Szego - 1972
31   Rinehart and Winston (context) - Lorentz, Functions - 1966
16   Schwankung von Polynomen zwischen Gitterpunkten (context) - Ehlich, Zeller - 1964
11   Approximation Theory (context) - Cheney - 1966
6   Separating PH from PP by Relativization (context) - Fu - 1990
4   and the Polynomial Time Hierarchy (context) - Beigel, PP - 1992
3   A Measure of Assymptotic Efficiency for Tests of a Hypothesi.. (context) - Chernoff - 1952
3   Lower Bounds for Perceptrons Solving some Separation Problem.. - Vereshchagin - 1994
2   Linear Programming (context) - Ashmanov - 1981
2   th Annual IEEE Symposium on Foundation of Computer Science (context) - Blum, Impagliazzo et al. - 1987
2   On the computational power of PP and \PhiP, 30th Annual IEEE.. (context) - Toda - 1989
1   Average Dependence and Random Oracle (context) - Kurtz, Mahaney et al. - 1992
1   Third Israel Symposium on Theory of Computing and Systems (context) - Co-NP-immune, to et al.
1   Seventh Conference on Structure in Complexity Theory (context) - Power, PP - 1992
1   th Annual ACM Symposium on Theory of Computing (context) - Babai, Theory et al. - 1985
1   Relative to a random oracle P6=NP6=coNP with probability (context) - Bennett, Gill - 1981
1   Co-NP-sets and P-sets relative to random oracles (context) - NP-sets
1   Third Israel Symposium on Theory of Computing and Systems (context) - for, some et al. - 1995

Documents on the same site (http://lpcs.math.msu.ru/~ver/publ-enc.html):   More
Randomized Boolean Decision Trees: Several Remarks - Vereshchagin (1998)   (Correct)
Independent Minimum Length Programs to Translate Between.. - Vereshchagin, Vyugin   (Correct)
A General Method to Construct Oracles Realizing Given.. - Muchnik, Vereshchagin (1994)   (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