scientific article

From MaRDI portal

Revision as of 04:01, 6 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

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

Publication:4053629

Jump to:navigation, search

zbMath0299.02043MaRDI QIDQ4053629

Claus Peter Schnorr

Publication date: 1974

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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to mathematical logic and foundations (03-01) Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) Automata and formal grammars in connection with logical questions (03D05) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Recursive functions and relations, subrecursive hierarchies (03D20) Turing machines and related notions (03D10)

Related Items (5)

On recursive bounds for the exceptional values in speed-up ⋮ Data representation and computational complexity ⋮ The equivalence of Horn and network complexity for Boolean functions ⋮ Unnamed Item ⋮ The LBA-problem and the deterministic tape complexity of two-way one- counter languages over a one-letter alphabet

This page was built for publication:

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