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

Fedor Part, Iddo Tzameret

Research output: Contribution to journalArticlepeer-review

32 Downloads (Pure)
Original languageEnglish
Article number2
JournalComputational Complexity
Volume30
Issue number1
DOIs
Publication statusPublished - 8 Jan 2021

Keywords

  • 03F20
  • 13P15
  • 68Q17
  • Linear decision trees
  • Lower bounds
  • Polynomial calculus
  • Proof complexity
  • Propositional pigeonhole principle
  • Resolution
  • Resolution over linear equations
  • Tseitin formulas

Cite this