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

zbMath0701.68030MaRDI QIDQ3995641

Birgit Jenner, Bernd Kirsig

Publication date: 23 January 1993


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

zbMATH Keywords

Turing machinesreductionsalternationlogarithmic spacestructural complexitycomplexity hierarchies


Mathematics Subject Classification ID

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


Related Items

NL-printable sets and nondeterministic Kolmogorov complexity ⋮ Expressing uniformity via oracles ⋮ Depth-first search in directed planar graphs, revisited ⋮ Parallel complexity of iterated morphisms and the arithmetic of small numbers ⋮ Adaptive logspace reducibility and parallel time ⋮ NL-printable sets and Nondeterministic Kolmogorov Complexity




This page was built for publication:

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