scientific article; zbMATH DE number 1414298
From MaRDI portal
Publication:4942635
zbMath0941.03547MaRDI QIDQ4942635
Publication date: 16 March 2000
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Mechanization of proofs and logical operations (03B35) Complexity of computation (including implicit computational complexity) (03D15) Complexity of proofs (03F20)
Related Items
A modal view on resource-bounded propositional logics ⋮ Protocol Verification Via Rigid/Flexible Resolution ⋮ Proving with BDDs and control of information ⋮ On the modelling of search in theorem proving -- towards a theory of strategy analysis ⋮ Encoding First Order Proofs in SMT
Uses Software
