PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Berkholz, Christoph"

Author of the publication

copydeleteadd this publication to your clipboard
On the speed of constraint propagation and the time complexity of arc consistency testing

, and . CoRR, (2013)

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.

Hon. -Prof. Christoph Müller University of Stuttgart

Dr. -Ing. Christoph Wenzel University of Stuttgart

Dr.-Ing. Christoph Steinhausen University of Stuttgart

Christoph Schulz University of Stuttgart

Christoph Jeromin University of Stuttgart

 

Other publications of authors with the same name

Lower Bounds for Existential Pebble Games and k-Consistency Tests. Logical Methods in Computer Science, (2013)Tight Lower and Upper Bounds for the Complexity of Canonical Colour Refinement., , and . CoRR, (2015)Near-Optimal Lower Bounds on Quantifier Depth and Weisfeiler-Leman Refinement Steps., and . LICS, page 267-276. ACM, (2016)Bounds for the quantifier depth in finite-variable logics: Alternation hierarchy., , and . CSL, volume 23 of LIPIcs, page 61-80. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, (2013)Tight Lower and Upper Bounds for the Complexity of Canonical Colour Refinement., , and . ESA, volume 8125 of Lecture Notes in Computer Science, page 145-156. Springer, (2013)Supercritical Space-Width Trade-Offs for Resolution., and . ICALP, volume 55 of LIPIcs, page 57:1-57:14. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, (2016)Limitations of Algebraic Approaches to Graph Isomorphism Testing., and . ICALP (1), volume 9134 of Lecture Notes in Computer Science, page 155-166. Springer, (2015)Compiling Existential Positive Queries to Bounded-Variable Fragments., and . PODS, page 353-364. ACM, (2019)The Relation between Polynomial Calculus, Sherali-Adams, and Sum-of-Squares Proofs.. Electronic Colloquium on Computational Complexity (ECCC), (2017)Linear Diophantine Equations, Group CSPs, and Graph Isomorphism., and . SODA, page 327-339. SIAM, (2017)