Loading...
Loading...

Go to the content (press return)

The complexity of resource-bounded propositional proofs

Author
Atserias, A.
Type of activity
Theses
Other related units
Department of Computer Science
Defense's date
2002-02-25
Award
2004 UPC Phd award
Group of research
ALBCOM - Algorithms, Computational Biology, Complexity and Formal Methods
LARCA - Laboratory of Relational Algorithmics, Complexity and Learnability
LOGPROG - Logic and Programming

Participants