scientific article
From MaRDI portal
Publication:2784604
zbMATH Open0990.03026MaRDI QIDQ2784604
Publication date: 24 April 2002
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
computational complexityNP-complete problemsdecision procedurecoherent probability assessmentselimination of Boolean variablesPSAT problem
Analysis of algorithms and problem complexity (68Q25) Probability and inductive logic (03B48) Logic in computer science (03B70) Complexity of computation (including implicit computational complexity) (03D15)
Related Items (5)
\(n\)-tuple algebra-based probabilistic logic ⋮ Unnamed Item ⋮ Levels of uniformity ⋮ Combining probability and logic: papers from Progic 2011 ⋮ Probability logic: A model-theoretic perspective
This page was built for publication: