|
Proceedings of the Yerevan State University, series Physical and Mathematical Sciences, 2011, Issue 3, Pages 3–8
(Mi uzeru185)
|
|
|
|
This article is cited in 1 scientific paper (total in 1 paper)
Mathematics
Polynomial length proofs for some class of Tseitin formulas
A. G. Abajian Chair of Discrete Mathematics and Theoretical Computer Science YSU, Armenia
Abstract:
In this paper the notion of quasi-hard determinative formulas is introduced and the proof complexities of such formulas are investigated. For some class of quasi-hard determinative formulas the same order lower and upper bounds for the length of proofs are obtained in several proof systems, basing on disjunctive normal forms (conjunctive normal forms).
Keywords:
proof complexity, Split Tree, resolution system, resolution over linear equations, determinative conjunct, quasi-hard determinative formula.
Received: 21.03.2011 Accepted: 20.04.2011
Citation:
A. G. Abajian, “Polynomial length proofs for some class of Tseitin formulas”, Proceedings of the YSU, Physical and Mathematical Sciences, 2011, no. 3, 3–8
Linking options:
https://www.mathnet.ru/eng/uzeru185 https://www.mathnet.ru/eng/uzeru/y2011/i3/p3
|
Statistics & downloads: |
Abstract page: | 133 | Full-text PDF : | 31 | References: | 33 |
|