( en | de | ru )

 

Disambiguation of "Lautemann, Clemens"

Author of the publication

copydeleteadd this publication to your clipboard
Lower Time Bounds for Integer Programming with Two Variables.

, and . Inf. Process. Lett., 21 (2): 101-105 (1985)

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.

Clemens Lautemann

Wolfgang Lautemann

Nico Lautemann

Willi Lautemann

Willi Lautemann

 

Other publications of authors with the same name

Logical Definability of NP-Optimization Problems with Monadic Auxiliary Predicates.. CSL, volume 702 of Lecture Notes in Computer Science, page 327-339. Springer, (1992)A simple proof of the polylog counting ability of first-order logic: guest column., , and . SIGACT News, 38 (4): 40-45 (2007)Decomposition Trees: Structured Graph Representation and Efficient Algorithms.. CAAP, volume 299 of Lecture Notes in Computer Science, page 28-39. Springer, (1988)First-order expressibility of languages with neutral letters or: The Crane Beach conjecture., , , , and . J. Comput. Syst. Sci., 70 (2): 101-127 (2005)Termination Proofs and the Length of Derivations (Preliminary Version)., and . RTA, volume 355 of Lecture Notes in Computer Science, page 167-177. Springer, (1989)MonadicNLIN and Quantifier-Free Reductions., and . CSL, volume 1683 of Lecture Notes in Computer Science, page 322-337. Springer, (1999)A note on polynomial interpretation.. Bulletin of the EATCS, (1988)BPP and the Polynomial Hierarchy.. Inf. Process. Lett., 17 (4): 215-217 (1983)Efficient Algorithms on Context-Free Graph Grammars.. ICALP, volume 317 of Lecture Notes in Computer Science, page 362-378. Springer, (1988)An Algebraic Point of View on the Crane Beach Property., , and . CSL, volume 4207 of Lecture Notes in Computer Science, page 426-440. Springer, (2006)