scientific article

From MaRDI portal

Revision as of 14:49, 5 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:3809270

Jump to:navigation, search

zbMath0659.68075MaRDI QIDQ3809270

Krzysztof Loryś, Maciej Liśkiewicz

Publication date: 1988

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

zbMATH Keywords

simulation of Turing machines nondeterministic Turing machine Fürer's counter nondeterministic complexity class tight hierarchy

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Related Items (2)

An NP-complete language accepted in linear time by a one-tape Turing machine ⋮ A speed-up theorem without tape compression

This page was built for publication:

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3809270&oldid=17385396"