Near-Optimal Lower Bounds on Regular Resolution Refutations of Tseitin Formulas for All Constant-Degree Graphs
Work
Year: 2021
Type: article
Source: Computational Complexity
Institutions St. Petersburg Department of Steklov Institute of Mathematics, Saint Petersburg State University of Economics, National Research University Higher School of Economics
Cites: 38
Cited by: 4
Related to: 10
FWCI: 0.518
Citation percentile (by year/subfield): 51.97
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: closed