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

zbMath0753.68043MaRDI QIDQ3974851

Carme Àlvarez, Josep Diaz, Jacobo Toran

Publication date: 26 June 1992


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

zbMATH Keywords

complexity of decision problemsP- and NP-completenessrobust Turing machines


Mathematics Subject Classification ID

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


Related Items (3)

The emptiness problem for intersections of regular languages ⋮ Guess-and-verify versus unrestricted nondeterminism for OBDDs and one-way Turing machines. ⋮ Molecular computing, bounded nondeterminism, and efficient recursion




This page was built for publication:

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3974851&oldid=12018406"
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:36.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki