Complexity of Propositional Proofs with Counting: Resolution over Linear Equations and Semi-Algebraic Proofs

Fjodor Part

Research output: ThesisDoctoral Thesis

101 Downloads (Pure)
Original languageEnglish
QualificationPh.D.
Awarding Institution
  • Royal Holloway, University of London
Award date1 Jun 2019
Publication statusUnpublished - 2019

Cite this