Supercritical space-width trade-offs for resolution

Christoph Berkholz, Jakob Nordström

Type: Article

Publication Date: 2016-08-17

Citations: 1

DOI: https://doi.org/10.4230/lipics.icalp.2016.57

View Publication

Locations

International Colloquium on Automata, Languages and Programming - View

Similar Works

Action	Title	Year	Authors
+	Supercritical Space-Width Trade-offs for Resolution	2016	Christoph Berkholz Jakob Nordström
+	Supercritical Space-Width Trade-offs for Resolution	2016	Christoph Berkholz Jakob Nordström
+ PDF Chat	Supercritical Space-Width Trade-offs for Resolution	2020	Christoph Berkholz Jakob Nordström
+	On Space and Depth in Resolution.	2016	Alexander Razborov
+	From Small Space to Small Width in Resolution	2014	Yuval Filmus Massimo Lauria Mladen Mikša Jakob Nordström Marc Vinyals
+	From Small Space to Small Width in Resolution	2014	Yuval Filmus Massimo Lauria Mladen Mikša Jakob Nordström Marc Vinyals
+	Short Proofs May Be Spacious: An Optimal Separation of Space and Length in Resolution.	2009	Eli Ben‐Sasson Jakob Nordström
+	Narrow Proofs May Be Maximally Long	2014	Albert Atserias Massimo Lauria Jakob Nordström
+	Narrow Proofs May Be Maximally Long	2014	Albert Atserias Massimo Lauria Jakob Nordström
+ PDF Chat	From Small Space to Small Width in Resolution	2015	Yuval Filmus Massimo Lauria Mladen Mikša Jakob Nordström Marc Vinyals
+	Polynomial calculus space and resolution width.	2019	Nicola Galesi Leszek Aleksander Kołodziejczyk Neil Thapen
+ PDF Chat	Narrow Proofs May Be Maximally Long	2016	Albert Atserias Massimo Lauria Jakob Nordström
+ PDF Chat	Polynomial Calculus Space and Resolution Width	2019	Nicola Galesi Leszek Aleksander Kołodziejczyk Neil Thapen
+ PDF Chat	On the Complexity of Finding Narrow Proofs	2012	Christoph Berkholz
+	Narrow Proofs May Be Maximally Long.	2014	Albert Atserias Massimo Lauria Jakob Nordström
+	Understanding space in resolution: optimal lower bounds and exponential trade-offs	2008	Eli Ben‐Sasson Jakob Nordström
+ PDF Chat	None	2016	Neil Thapen
+	Random resolution refutations	2017	Pavel Pudlák Neil Thapen
+	Unsatisfiable Linear CNF Formulas Are Large and Complex	2009	Dominik Scheder
+	Unsatisfiable Linear CNF Formulas Are Large, and Difficult to Construct Explicitely	2009	Dominik Scheder

Works That Cite This (1)

Action	Title	Year	Authors
+ PDF Chat	Polynomial Calculus Space and Resolution Width	2019	Nicola Galesi Leszek Aleksander Kołodziejczyk Neil Thapen

Works Cited by This (0)

Action	Title	Year	Authors