scientific article

From MaRDI portal

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

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

Publication:3880807

Jump to:navigation, search

zbMath0439.03004MaRDI QIDQ3880807

Klaus Fleischmann, Dirk Siefkes, Bernd Mahr

Publication date: 1977

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

zbMATH Keywords

logical theories lower complexity bounds bounded concatenation theory bounded word theory

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Complexity of computation (including implicit computational complexity) (03D15)

Related Items (6)

THE RECOGNITION COMPLEXITY OF DECIDABLE THEORIES ⋮ Complexity of Boolean algebras ⋮ On time-space classes and their relation to the theory of real addition ⋮ The complexity of Presburger arithmetic with bounded quantifier alternation depth ⋮ A uniform method for proving lower bounds on the computational complexity of logical theories ⋮ Turing machines with linear alternation, theories of bounded concatenation and the decision problem of first order theories

This page was built for publication:

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