Loading...
Loading...

Go to the content (press return)

Unsatisfiable Random Formulas Are Hard to Certify

Author
Atserias, A.
Type of activity
Presentation of work at congresses
Name of edition
17th IEEE Symposium on Logic in Computer Science (LICS 2002)
Date of publication
2002
Presentation's date
2002
Book of congress proceedings
Proceedings of the 17th IEEE Symposium on Logic in Computer Science (LICS 2002)
First page
325
Last page
334
URL
http://cataleg.upc.edu/record=b1167117~S1*cat Open in new window
Group of research
ALBCOM - Algorithms, Computational Biology, Complexity and Formal Methods

Participants