Resolution with Counting: Dag and Tree-like Lower Bounds over Different Moduli. / Part, Fjodor; Tzameret, Iddo.

2018. Abstract from Workshop on Proof Complexity (PC 2018), Oxford, United Kingdom.

Research output: Contribution to conferenceAbstract

Forthcoming
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)
CountryUnited Kingdom
CityOxford
Period7/07/188/07/18
Internet address
This open access research output is licenced under a Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported License.

ID: 29514621