Product
Help
Pricing
About
Jobs
Log in
Get started
Work
Add to collection
Near-Optimal Separation of Treelike and General Resolution
HTML
Details
Locations
Year:
2000
Type:
preprint
Source:
Electronic colloquium on computational complexity
Authors:
Eli Ben‐Sasson,
Russell Impagliazzo,
Avi Wigderson
Language:
English
Topic:
Complexity and Algorithms in Graphs
Subfield:
Computational Theory and Mathematics
Field:
Computer Science
Domain:
Physical Sciences
Keywords:
tree-like resolution,
proof complexity,
exponential lower bounds
Open Access status:
closed
Funders:
Università degli Studi di Cagliari,
Technische Universität Wien
OpenAlex ID:
W38318608
Cites:
Cited by:
68
Related to:
10