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

Standard

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

Harvard

APA

Vancouver

Part F, Tzameret I. Resolution with Counting: Dag and Tree-like Lower Bounds over Different Moduli. 2018. Abstract from Workshop on Proof Complexity (PC 2018), Oxford, United Kingdom.

Author

Part, Fjodor ; Tzameret, Iddo. / Resolution with Counting: Dag and Tree-like Lower Bounds over Different Moduli. Abstract from Workshop on Proof Complexity (PC 2018), Oxford, United Kingdom.

BibTeX

@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",

}

RIS

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 -