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

Fjodor Part, Iddo Tzameret

Research output: Contribution to conference › Abstract

20 Downloads (Pure)

Original language	English
Publication status	Accepted/In press - 18 May 2018
Event	Workshop on Proof Complexity (PC 2018): Part of FLoC 2018 at Oxford University - University of Oxford, Oxford, United Kingdom Duration: 7 Jul 2018 → 8 Jul 2018 https://easychair.org/smart-program/FLoC2018/PC-index.html

Workshop	Workshop on Proof Complexity (PC 2018)
Country/Territory	United Kingdom
City	Oxford
Period	7/07/18 → 8/07/18
Internet address	https://easychair.org/smart-program/FLoC2018/PC-index.html

Keywords

@conference{a30474ba500a405a8d4752178fc5c255,

title = "Resolution with Counting: Dag and Tree-like Lower Bounds over Different Moduli",

keywords = "computational complexity, Lower bounds, resolution",

author = "Fjodor Part and Iddo Tzameret",

year = "2018",

month = may,

day = "18",

language = "English",

note = "Workshop on Proof Complexity (PC 2018) : Part of FLoC 2018 at Oxford University ; Conference date: 07-07-2018 Through 08-07-2018",

url = "https://easychair.org/smart-program/FLoC2018/PC-index.html",

}

TY - CONF

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

AU - Part, Fjodor

AU - Tzameret, Iddo

PY - 2018/5/18

Y1 - 2018/5/18

KW - computational complexity

KW - Lower bounds

KW - resolution

UR - http://www.cs.rhul.ac.uk/home/tzameret/Res-Lin-Two.pdf

M3 - Abstract

T2 - Workshop on Proof Complexity (PC 2018)

Y2 - 7 July 2018 through 8 July 2018

ER -