Now showing items 1-4 of 4

    • On lower bounds for circuit complexity and algorithms for satisfiability 

      Casals Buñuel, Joaquim (Universitat Politècnica de Catalunya, 2017-10)
      Master thesis
      Open Access
      This 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 

      Oliva Valls, Sergi (Universitat Politècnica de Catalunya, 2013-05-02)
      Doctoral thesis
      Open Access
      Propositional 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 

      Oliva Valls, Sergi (Universitat Politècnica de Catalunya, 2007-06-25)
      Master thesis
      Open Access
    • Size bounds for algebraic and semialgebraic proof systems 

      Hakoniemi, Tuomas Antero (Universitat Politècnica de Catalunya, 2022-03-25)
      Doctoral thesis
      Open Access
      This 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 ...