scientific article; zbMATH DE number 1538017
From MaRDI portal
Publication:4518872
zbMath0961.03011MaRDI QIDQ4518872
Publication date: 5 June 2001
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Decidability of theories and sets of sentences (03B25) Mechanization of proofs and logical operations (03B35) Complexity of computation (including implicit computational complexity) (03D15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (3)
Unnamed Item ⋮ Tractable combinations of theories via sampling ⋮ Unions of non-disjoint theories and combinations of satisfiability procedures
This page was built for publication: