A bound on the length of a random derivation-search tree in general multi-premise calculi

DOI10.1007/BF01068328zbMath0752.03022OpenAlexW2041263082MaRDI QIDQ4007369

Yu. N. Kur'erov

Publication date: 27 September 1992

Published in: Cybernetics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01068328

zbMATH Keywords

complexity boundsmulti-premise calculiPost calculusrandom derivation search trees

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15)

Cites Work

• Unnamed Item
• Probabilistic canonical calculi
• On the complexity of regular resolution and the Davis-Putnam procedure
• A problem on random trees
• On Resolution with Clauses of Bounded Size
• Formal Reductions of the General Combinatorial Decision Problem

This page was built for publication: A bound on the length of a random derivation-search tree in general multi-premise calculi