scientific article; zbMATH DE number 1341610
From MaRDI portal
Publication:4263159
zbMath0937.03019MaRDI QIDQ4263159
Publication date: 17 February 2000
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
NP-completenesssatisfiability problemcomplexity analysisequational problemsinfinite Herbrand universe
Analysis of algorithms and problem complexity (68Q25) Mechanization of proofs and logical operations (03B35) Complexity of computation (including implicit computational complexity) (03D15)
Related Items (max. 100)
Extracting models from clause sets saturated under semantic refinements of the resolution rule. ⋮ On the complexity of equational problems in CNF ⋮ Explicit versus implicit representations of subsets of the Herbrand universe.
This page was built for publication: