Informatikwissenschaften
FB IV - Wirtschafts- und Sozialwissenschaften, Mathematik, Informatikwissenschaften / Universität Trier
- 0651/
- 0651/
Mundhenk, M.
Complexity of propositional proof systems: tableaux, resolution, cutting-planes11th European Summerschool on Logic, Language, and Information. 1999
Seidl, H.; Neumann, A.
Contributed Papers - Linear Logic, Mu Calculus, Concurrency - On Guarding Nested FixpointsLecture 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 onesInformation 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-Methodology1999
Damm, Carsten; Kim, Ki Hang; Roush, Fred
Discrete Mathematics - On Covering and Rank Problems for Boolean Matrices and Their ApplicationsLecture 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
Bergmann, Ralph; Vollrath, Ivo
Generalized Cases: Representation and Steps Towards Efficient Similarity Assessment.KI. 1999 S. 195 - 206
Mundhenk, M.; Margenstern, M.; Singer, D.
Hard instances of NP-hard setsMargenstern, M.; Singer, D. (Hrsg). Proceedings of JIM´99. Metz. 1999 S. 120 - 131
Czap, H.; Reiter, J.
Kooperativ-intelligente Agenten zur Terminkoordination von medizinischen Einrichtungen in der KrebstherapieProceedings des Workshops Agententechnologie, KI 99. Bd. Proceedings des Workshops Agententechnologie, KI 99. Bonn. 1999