PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Atserias, Albert"

Author of the publication

copydeleteadd this publication to your clipboard
On Chvatal Rank and Cutting Planes Proofs

, , and . Electronic Colloquium on Computational Complexity (ECCC), (2003)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Univ. -Prof. Dr. Albert Jeltsch University of Stuttgart

Dr. Albert Julius Rostas University of Stuttgart

Hon. -Prof. Dr. Albert Nonnenmacher University of Stuttgart

Albert Emrich University of Stuttgart

apl. Prof. Dr. -Ing. Albert Bursik University of Stuttgart

 

Other publications of authors with the same name

Size-Degree Trade-Offs for Sums-of-Squares and Positivstellensatz Proofs., and . CoRR, (2018)Quantum and non-signalling graph isomorphisms., , , , , and . J. Comb. Theory, Ser. B, (2019)First-Order Logic vs. Fixed-Point Logic in Finite Set Theory., and . LICS, page 275-284. IEEE Computer Society, (1999)Monotone simulations of non-monotone proofs., , and . J. Comput. Syst. Sci., 65 (4): 626-638 (2002)Improved bounds on the Weak Pigeonhole Principle and infinitely many primes from weaker axioms.. Theor. Comput. Sci., (2003)On the Power of k -Consistency., , and . ICALP, volume 4596 of Lecture Notes in Computer Science, page 279-290. Springer, (2007)Improved Bounds on the Weak Pigeonhole Principle and Infinitely Many Primes from Weaker Axioms.. MFCS, volume 2136 of Lecture Notes in Computer Science, page 148-158. Springer, (2001)Monotone Proofs of the Pigeon Hole Principle., , and . Math. Log. Q., 47 (4): 461-474 (2001)Non-Homogenizable Classes of Finite Structures., and . CSL, volume 62 of LIPIcs, page 16:1-16:16. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, (2016)Monotone Simulations of Nonmonotone Proofs., , and . Computational Complexity Conference, page 36-41. IEEE Computer Society, (2001)