Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > AUTHORS > ERFAN KHANIKI:
All reports by Author Erfan Khaniki:

TR20-034 | 12th March 2020
Erfan Khaniki

On Proof complexity of Resolution over Polynomial Calculus

Revisions: 1

The refutation system ${Res}_R({PC}_d)$ is a natural extension of resolution refutation system such that it operates with disjunctions of degree $d$ polynomials over ring $R$ with boolean variables. For $d=1$, this system is called ${Res}_R({lin})$. Based on properties of $R$, ${Res}_R({lin})$ systems can be too strong to prove lower ... more >>>




ISSN 1433-8092 | Imprint