Starten Sie Ihre Suche...


Wir weisen darauf hin, dass wir technisch notwendige Cookies verwenden. Weitere Informationen
Publikationen
PDF | RTF
Ergebnisse pro Seite:  10

Fernau, Henning; Niedermeier, Rolf

An Efficient Exact Algorithm for Constraint Bipartite Vertex Cover.

MFCS. 1999 S. 387 - 397



Fernau, Henning; Stephan, Frank

Characterizations of Recursively Enumerable Languages by Programmed Grammars With Unconditional Transfer.

J. Autom. Lang. Comb. Bd. 4. H. 2. 1999 S. 117 - 142


Mundhenk, M.

Complexity of propositional proof systems: tableaux, resolution, cutting-planes

11th European Summerschool on Logic, Language, and Information. 1999


Seidl, H.; Neumann, A.

Contributed Papers - Linear Logic, Mu Calculus, Concurrency - On Guarding Nested Fixpoints

Lecture notes in computer science. Bd. 1683. Berlin: Springer 1999 S. 484 - 498


Fernau, Henning; Reinhardt, Klaus; Staiger, Ludwig

Decidability of code properties.

Developments in Language Theory. 1999 S. 153 - 163


Damm, Carsten

Depth-efficient simulation of Boolean semi-unbounded circuits by arithmetic ones

Information processing letters. devoted to the rapid publication of short contributions to information processing. Bd. 69. H. 4. Amsterdam [u.a.]: Elsevier 1999 S. 175 - 180


Bergmann, Ralph; Althoff, Klaus-Dieter; Breen, Sean et al.

Developing Industrial Case-Based Reasoning Applications: The INRECA-Methodology

Springer 1999


Damm, Carsten; Kim, Ki Hang; Roush, Fred

Discrete Mathematics - On Covering and Rank Problems for Boolean Matrices and Their Applications

Lecture notes in computer science. Bd. 1627. Berlin: Springer 1999 S. 123 - 133


Fernau, Henning

Efficient Learning of Some Linear Matrix Languages.

COCOON. 1999 S. 221 - 230