scientific article; zbMATH DE number 3534486
From MaRDI portal
Publication:4110999
zbMath0343.02035MaRDI QIDQ4110999
Publication date: 1976
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Decidability of theories and sets of sentences (03B25) Applications of computability and recursion theory (03D80) Turing machines and related notions (03D10)
Related Items (2)
Complexity of Subcases of Presburger Arithmetic ⋮ The complexity of Presburger arithmetic with bounded quantifier alternation depth
This page was built for publication:
