( en | de | ru )

 

Disambiguation of "Grohe, Martin"

Author of the publication

copydeleteadd this publication to your clipboard
Bounded-Arity Hierarchies in Fixed-Point Logics.

. CSL, volume 832 of Lecture Notes in Computer Science, page 150-164. Springer, (1993)

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.

Martin Grohe

Ulrich Martin Grohe

Maria Grohe

Bernd Grohe

Ursula Grohé

 

Other publications of authors with the same name

From polynomial time queries to graph structure theory.. Commun. ACM, 54 (6): 104-112 (2011)Generative Datalog with Continuous Distributions., , , and . PODS, page 347-360. ACM, (2020)Recent Advances on the Graph Isomorphism Problem., and . CoRR, (2020)Bounded-Arity Hierarchies in Fixed-Point Logics.. CSL, volume 832 of Lecture Notes in Computer Science, page 150-164. Springer, (1993)05301 Summary - Exact Algorithms and Fixed-Parameter Tractability., , and . Exact Algorithms and Fixed-Parameter Tractability, volume 05301 of Dagstuhl Seminar Proceedings, Internationales Begegnungs- und Forschungszentrum für Informatik (IBFI), Schloss Dagstuhl, Germany, (2005)05301 Abstracts Collection - Exact Algorithms and Fixed-Parameter Tractability., , and . Exact Algorithms and Fixed-Parameter Tractability, volume 05301 of Dagstuhl Seminar Proceedings, Internationales Begegnungs- und Forschungszentrum für Informatik (IBFI), Schloss Dagstuhl, Germany, (2005)Constraint solving via fractional edge covers., and . SODA, page 289-298. ACM Press, (2006)A Finite-Model-Theoretic View on Propositional Proof Complexity., , , and . Logical Methods in Computer Science, (2019)Bounded Fixed-Parameter Tractability and log2n Nondeterministic Bits., , and . ICALP, volume 3142 of Lecture Notes in Computer Science, page 555-567. Springer, (2004)One Model, Any CSP: Graph Neural Networks as Fast Global Search Heuristics for Constraint Satisfaction., , , and . IJCAI, page 4280-4288. ijcai.org, (2023)