Oracle‐Constructions to Prove All Possible Relationships Between Relativizations of P, NP, EL, NEL, EP and NEP

Mathematical Logic Quarterly 32 (17‐18):257-270 (1986)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Add categories

Keywords

Reprint years

DOI

10.1002/malq.19860321702

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,069

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Oracle‐Constructions to Prove All Possible Relationships Between Relativizations of P, NP, EL, NEL, EP and NEP.Gerhard Lischke - 1986 - Mathematical Logic Quarterly 32 (17-18):257-270.
P ≠ NP for all infinite Boolean algebras.Mihai Prunescu - 2003 - Mathematical Logic Quarterly 49 (2):210-213.
P_≠ _NP for all infinite Boolean algebras.Mihai Prunescu - 2003 - Mathematical Logic Quarterly 49 (2):210-213.
Towards the Actual Relationship Between NP and Exponential Time.Gerhard Lischke - 1999 - Mathematical Logic Quarterly 45 (1):31-49.
Generic separations and leaf languages.M. Galota, H. Vollmer & S. Kosub - 2003 - Mathematical Logic Quarterly 49 (4):353.
P^f NP^f for almost all f.J. D. Hamkins - 2003 - Mathematical Logic Quarterly 49 (5):536.
Two NP‐Hard Art‐Gallery Problems for Ortho‐Polygons.Dietmar Schuchardt & Hans-Dietrich Hecker - 1995 - Mathematical Logic Quarterly 41 (2):261-267.
Minimizing the Size of Vertexlights in Simple Polygons.Andreas Spillner & Hans-Dietrich Hecker - 2002 - Mathematical Logic Quarterly 48 (3):447-458.
Separations et transferts dans la hierarchie polynomiale des groupes abeliens lifinis.Ménard Bourgade - 2001 - Mathematical Logic Quarterly 47 (4):493-502.
A Second Normal Form For Functions Of The System Ep.Rod Mcbeth - 1984 - Mathematical Logic Quarterly 30 (25):393-400.

Analytics

Added to PP
2013-12-01

Downloads
5 (#1,562,182)

6 months
1 (#1,516,021)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

Computational Complexity.K. Wagner & G. Wechsung - 1989 - Journal of Symbolic Logic 54 (2):622-624.

Add more references