Browsing by Contributor "Atserias, Albert"
Now showing items 1-4 of 4
(Universitat Politècnica de Catalunya, 2017-10)
Open AccessThis 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 ...
(Universitat Politècnica de Catalunya, 2013-05-02)
Open AccessPropositional 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 ...
(Universitat Politècnica de Catalunya, 2007-06-25)
(Universitat Politècnica de Catalunya, 2022-03-25)
Open AccessThis 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 ...