scientific article
From MaRDI portal
Publication:3960661
zbMath0497.03007MaRDI QIDQ3960661
Publication date: 1981
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Decidability (number-theoretic aspects) (11U05) Decidability of theories and sets of sentences (03B25) Complexity of computation (including implicit computational complexity) (03D15)
Related Items (4)
NP-complete problems for systems of linear polynomial's values divisibilities ⋮ Simultaneous rigid E-unification and other decision problems related to the Herbrand theorem ⋮ A proof of Bel'tyukov-Lipshitz theorem by quasi-quantifier elimination. I: Definitions and GCD-lemma ⋮ On parametric timed automata and one-counter machines
This page was built for publication:
