Resolution with Counting: Dag and Tree-like Lower Bounds over Different Moduli

Fjodor Part, Iddo Tzameret

Research output: Contribution to conferenceAbstract

20 Downloads (Pure)
Original languageEnglish
Publication statusAccepted/In press - 18 May 2018
EventWorkshop on Proof Complexity (PC 2018): Part of FLoC 2018 at Oxford University - University of Oxford, Oxford, United Kingdom
Duration: 7 Jul 20188 Jul 2018
https://easychair.org/smart-program/FLoC2018/PC-index.html

Workshop

WorkshopWorkshop on Proof Complexity (PC 2018)
Country/TerritoryUnited Kingdom
CityOxford
Period7/07/188/07/18
Internet address

Keywords

  • computational complexity
  • Lower bounds
  • resolution

Cite this