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:3971264
Jump to:navigation, search

zbMath0744.68053MaRDI QIDQ3971264

Richard Chang, Pankaj Rohatgi

Publication date: 25 June 1992


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


Mathematics Subject Classification ID

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


Related Items

Propositional circumscription and extended closed-world reasoning are \(\Pi_ 2^ P\)-complete, On the computational cost of disjunctive logic programming: Propositional case, Complexity of unique list colorability



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