Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

scientific article

From MaRDI portal
Publication:3974853
Jump to:navigation, search

zbMath0756.68037MaRDI QIDQ3974853

No author found.

Publication date: 26 June 1992


Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

complexity hierarchyrandom polynomial timeBoolean closure


Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)


Related Items (7)

A relationship between difference hierarchies and relativized polynomial hierarchies ⋮ A downward translation in the polynomial hierarchy ⋮ On computing Boolean connectives of characteristic functions ⋮ On the power of deterministic reductions to C=P ⋮ Intersection suffices for Boolean hierarchy equivalence ⋮ Preface ⋮ Nondeterministic and randomized Boolean hierarchies in communication complexity







This page was built for publication:

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3974853&oldid=12018410"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 29 January 2024, at 23:36.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki