Resolution with Counting : Dag-Like Lower Bounds and Different Moduli. / Part, Fedor; Tzameret, Iddo.

In: Computational Complexity, Vol. 30, No. 1, 2, 08.01.2021.

Research output: Contribution to journalArticlepeer-review

Published

Standard

Resolution with Counting : Dag-Like Lower Bounds and Different Moduli. / Part, Fedor; Tzameret, Iddo.

In: Computational Complexity, Vol. 30, No. 1, 2, 08.01.2021.

Research output: Contribution to journalArticlepeer-review

Harvard

APA

Vancouver

Author

Part, Fedor ; Tzameret, Iddo. / Resolution with Counting : Dag-Like Lower Bounds and Different Moduli. In: Computational Complexity. 2021 ; Vol. 30, No. 1.

BibTeX

@article{4929c5adcff8416e90d5698e477f45bf,
title = "Resolution with Counting: Dag-Like Lower Bounds and Different Moduli",
keywords = "03F20, 13P15, 68Q17, Linear decision trees, Lower bounds, Polynomial calculus, Proof complexity, Propositional pigeonhole principle, Resolution, Resolution over linear equations, Tseitin formulas",
author = "Fedor Part and Iddo Tzameret",
year = "2021",
month = jan,
day = "8",
doi = "10.1007/s00037-020-00202-x",
language = "English",
volume = "30",
journal = "Computational Complexity",
issn = "1016-3328",
publisher = "Birkhauser Verlag Basel",
number = "1",

}

RIS

TY - JOUR

T1 - Resolution with Counting

T2 - Dag-Like Lower Bounds and Different Moduli

AU - Part, Fedor

AU - Tzameret, Iddo

PY - 2021/1/8

Y1 - 2021/1/8

KW - 03F20

KW - 13P15

KW - 68Q17

KW - Linear decision trees

KW - Lower bounds

KW - Polynomial calculus

KW - Proof complexity

KW - Propositional pigeonhole principle

KW - Resolution

KW - Resolution over linear equations

KW - Tseitin formulas

UR - http://www.scopus.com/inward/record.url?scp=85098949383&partnerID=8YFLogxK

U2 - 10.1007/s00037-020-00202-x

DO - 10.1007/s00037-020-00202-x

M3 - Article

AN - SCOPUS:85098949383

VL - 30

JO - Computational Complexity

JF - Computational Complexity

SN - 1016-3328

IS - 1

M1 - 2

ER -