Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



LATEST > REPORTS:
RSS-Feedprevious PreviousNext next

TR09-003 | 6th January 2009
Alex Hertel, Alasdair Urquhart

Comments on ECCC Report TR06-133: The Resolution Width Problem is EXPTIME-Complete

We discovered a serious error in one of our previous submissions to ECCC and wish to make sure that this mistake is publicly known.

The main argument of the report TR06-133 is in error. The paper claims to prove the result of the title by reduction from the (Exists,k)-pebble game, ... more >>>


TR09-002 | 23rd November 2008
Eli Ben-Sasson, Jakob Nordström

Short Proofs May Be Spacious: An Optimal Separation of Space and Length in Resolution

A number of works have looked at the relationship between length and space of resolution proofs. A notorious question has been whether the existence of a short proof implies the existence of a proof that can be verified using limited space.

In this paper we resolve the question by answering ... more >>>


TR09-001 | 26th November 2008
Venkatesan Guruswami

Artin automorphisms, Cyclotomic function fields, and Folded list-decodable codes

Algebraic codes that achieve list decoding capacity were recently
constructed by a careful ``folding'' of the Reed-Solomon code. The
``low-degree'' nature of this folding operation was crucial to the list
decoding algorithm. We show how such folding schemes conducive to list
decoding arise out of the Artin-Frobenius automorphism at primes ... more >>>



previous PreviousNext next


ISSN 1433-8092 | Imprint