Exploració per altres contribucions "Atserias, Albert"
Ara es mostren els items 1-4 de 4
-
On lower bounds for circuit complexity and algorithms for satisfiability
(Universitat Politècnica de Catalunya, 2017-10)
Projecte Final de Màster Oficial
Accés obertThis work is devoted to explore the novel method of proving circuit lower bounds for the class NEXP by Ryan Williams. Williams is able to show two circuit lower bounds: A conditional lower bound which says that NEXP does ... -
On the complexity of resolution-based proof systems
(Universitat Politècnica de Catalunya, 2013-05-02)
Tesi
Accés obertPropositional Proof Complexity is the area of Computational Complexity that studies the length of proofs in propositional logic. One of its main questions is to determine which particular propositional formulas have short ... -
Parallel repetition theorem and unique games
(Universitat Politècnica de Catalunya, 2007-06-25)
Projecte Final de Màster Oficial
Accés obert -
Size bounds for algebraic and semialgebraic proof systems
(Universitat Politècnica de Catalunya, 2022-03-25)
Tesi
Accés obertThis thesis concerns the proof complexity of algebraic and semialgebraic proof systems Polynomial Calculus, Sums-of-Squares and Sherali-Adams. The most studied complexity measure for these systems is the degree of the ...