Resolution with Counting: Dag-Like Lower Bounds and Different Moduli

Resolution over linear equations is a natural extension of the popular resolution refutation system, augmented with the ability to carry out basic counting. Denoted Res ( lin R ) , this refutation system operates with disjunctions of linear equations with Boolean variables over a ring R , to refute...

Full description

Saved in:

Bibliographic Details
Published in:	Computational complexity Vol. 30; no. 1
Main Authors:	Part, Fedor, Tzameret, Iddo
Format:	Journal Article
Language:	English
Published:	Cham Springer International Publishing 01.06.2021 Springer Nature B.V
Subjects:	Algorithm Analysis and Problem Complexity Boolean Boolean algebra Computational Mathematics and Numerical Analysis Computer Science Fields (mathematics) Linear equations Lower bounds Mathematical analysis Polynomials Lower bounds Propositional pigeonhole principle 68Q17 Resolution over linear equations 13P15 Proof complexity Linear decision trees Tseitin formulas 03F20 Polynomial calculus Resolution
ISSN:	1016-3328, 1420-8954
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!