Exploració per autor "Atserias, Albert"
Ara es mostren els items 1-20 de 55
-
A Note on polynomial-size monotone proofs of the pigeon hole principle
Atserias, Albert (2000-09)
Report de recerca
Accés obertWe see that the version of the pigeon-hole principle in which every hole is forced to receive a pigeon (called onto) and the version in which every pigeon is mapped into exactly one hole (called functional) have ... -
ALGORÍSMIA | PARCIAL
Roura Ferret, Salvador; Atserias, Albert; Duch Brown, Amalia; Petit Silvestre, Jordi (Universitat Politècnica de Catalunya, 2023-11-03)
Examen
Accés restringit a la comunitat UPC -
ALGORÍSMIA | EXTRAORDINARI
Atserias, Albert; Duch Brown, Amalia; Petit Silvestre, Jordi; Roura Ferret, Salvador (Universitat Politècnica de Catalunya, 2020-07-07)
Examen
Accés restringit a la comunitat UPC -
ALGORÍSMIA | EXTRAORDINARI
Atserias, Albert; Duch Brown, Amalia; Petit Silvestre, Jordi; Roura Ferret, Salvador (Universitat Politècnica de Catalunya, 2023-07-05)
Examen
Accés restringit a la comunitat UPC -
ALGORÍSMIA | EXTRAORDINARI
Atserias, Albert; Duch Brown, Amalia; Petit Silvestre, Jordi; Roura Ferret, Salvador (Universitat Politècnica de Catalunya, 2018-06-29)
Examen
Accés restringit a la comunitat UPC -
ALGORÍSMIA | EXTRAORDINARI
Atserias, Albert; Duch Brown, Amalia; Petit Silvestre, Jordi; Roura Ferret, Salvador (Universitat Politècnica de Catalunya, 2021-07-01)
Examen
Accés restringit a la comunitat UPC -
ALGORÍSMIA | FINAL
Atserias, Albert; Duch Brown, Amalia; Petit Silvestre, Jordi; Roura Ferret, Salvador (Universitat Politècnica de Catalunya, 2021-01-18)
Examen
Accés restringit a la comunitat UPC -
ALGORÍSMIA | FINAL
Atserias, Albert; Duch Brown, Amalia; Petit Silvestre, Jordi; Roura Ferret, Salvador (Universitat Politècnica de Catalunya, 2020-01-09)
Examen
Accés restringit a la comunitat UPC -
ALGORÍSMIA | FINAL
Roura Ferret, Salvador; Atserias, Albert; Duch Brown, Amalia; Petit Silvestre, Jordi (Universitat Politècnica de Catalunya, 2022-01-11)
Examen
Accés restringit a la comunitat UPC -
ALGORÍSMIA | FINAL
Atserias, Albert; Duch Brown, Amalia; Petit Silvestre, Jordi; Roura Ferret, Salvador (Universitat Politècnica de Catalunya, 2019-01-15)
Examen
Accés restringit a la comunitat UPC -
ALGORÍSMIA | FINAL
Atserias, Albert; Duch Brown, Amalia; Petit Silvestre, Jordi; Roura Ferret, Salvador (Universitat Politècnica de Catalunya, 2024-01-16)
Examen
Accés restringit a la comunitat UPC -
ALGORÍSMIA | PARCIAL
Atserias, Albert; Duch Brown, Amalia; Petit Silvestre, Jordi; Roura Ferret, Salvador (Universitat Politècnica de Catalunya, 2019-11-05)
Examen
Accés restringit a la comunitat UPC -
ALGORÍSMIA | PARCIAL
Atserias, Albert; Duch Brown, Amalia; Petit Silvestre, Jordi; Roura Ferret, Salvador (Universitat Politècnica de Catalunya, 2020-11-06)
Examen
Accés restringit a la comunitat UPC -
ALGORÍSMIA | PARCIAL
Atserias, Albert; Duch Brown, Amalia; Petit Silvestre, Jordi; Roura Ferret, Salvador (Universitat Politècnica de Catalunya, 2018-11-05)
Examen
Accés restringit a la comunitat UPC -
ALGORÍSMIA | PARCIAL
Atserias, Albert; Duch Brown, Amalia; Petit Silvestre, Jordi; Roura Ferret, Salvador (Universitat Politècnica de Catalunya, 2021-10-29)
Examen
Accés restringit a la comunitat UPC -
Automating resolution is NP-Hard
Atserias, Albert; Muller, Moritz Martin (2020-09)
Article
Accés obertWe show that the problem of finding a Resolution refutation that is at most polynomially longer than a shortest one is NP-hard. In the parlance of proof complexity, Resolution is not automatable unless P = NP. Indeed, we ... -
Automating Resolution is NP-hard
Atserias, Albert; Muller, Moritz Martin (Institute of Electrical and Electronics Engineers (IEEE), 2019)
Text en actes de congrés
Accés obertWe show that the problem of finding a Resolution refutation that is at most polynomially longer than a shortest one is NP-hard. In the parlance of proof complexity, Resolution is not automatizable unless P = NP. Indeed, ... -
Bounded-width QBF is PSPACE-complete
Atserias, Albert; Oliva Valls, Sergi (Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2013)
Text en actes de congrés
Accés obertTree-width is a well-studied parameter of structures that measures their similarity to a tree. Many important NP-complete problems, such as Boolean satisfiability (SAT), are tractable on bounded tree-width instances. In ... -
Bounded-width QBF is PSPACE-complete
Atserias, Albert; Oliva Valls, Sergi (2014-11-01)
Article
Accés obertTree-width and path-width are two well-studied parameters of structures that measure their similarity to a tree and a path, respectively. We show that QBF on instances with constant path-width, and hence constant tree-width, ... -
CALCULABILITAT (Examen 2n quadrim)
Atserias, Albert (Universitat Politècnica de Catalunya, 2010-05-31)
Examen
Accés restringit a la comunitat UPC