scientific article; zbMATH DE number 1222558

zbMath0911.03018MaRDI QIDQ4218095

Pavel Pudlák

Publication date: 2 March 1999

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

probabilistic algorithmsproof complexitysatisfiability of \(k\)-CNF formulas

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Decidability of theories and sets of sentences (03B25) Complexity of computation (including implicit computational complexity) (03D15) Relative consistency and interpretations (03F25)

Related Items (2)

A satisfiability algorithm and average-case hardness for formulas over the full binary basis ⋮ Satisfiability Algorithm for Syntactic Read-$k$-times Branching Programs

This page was built for publication: