Ewald Speckenmeyer und Peter - Info zur Person

(1 - 11 von 11

)

Satisfiability Problem: Theory and Applications : DIMACS ...books.google.dk › books

books.google.dk

1, D Koln and Theoretical Computer Science Volume 35, On the Use 676 EWALD SPECKENMEYER, MAX BOHM, AND PETER HEUSCH.

Satisfiability Problem: Theory and Applications : DIMACS Workshop,...

books.google.ch

Ewald Speckenmeyer, Max Bohm. and Peter Heusch ABSTRACT. Let F be Boolean formulas in conjunctive normal form with n variables, r clauses, every clause ...

CATS-computer Aided Tram Scheduling - Peter Heusch, Frank Meisgen,...

books.google.de

CATS-computer Aided Tram Scheduling. Front Cover. Peter Heusch, Frank Meisgen, Ewald Speckenmeyer. Univ., pages.

Improving a fixed parameter tractability time bound for the shadow...

www.sciencedirect.com

Improving a fixed parameter tractability time bound for the shadow problem. Author links open overlay panelPeterHeusch StefanPorschen Ewald Speckenmeyer.

Christian H. Stork

cstork.org

Towards Language-Agnostic Mobile Code by Christian H. Stork, Peter S. Housel, Vivek Haldar, Niall ... Parallel Algorithms I (University of Cologne, Ewald Speckenmeyer)

A satisfiability formulation of problems on level graphs — Rutgers ...www.researchwithrutgers.com › publications › a-sati...

www.researchwithrutgers.com

... problems on level graphs. Bert Randerath, Ewald Speckenmeyer, Endre Boros, Peter Hammer, Alex Kogan, Kazuhisa Makino, Bruno Simeone, Ondrej Cepek.