Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Journal=Discrete Appl.~Math. AND Volume=107
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Disjunctive and conjunctive normal forms of pseudo-Boolean functions
Stephan Foldes
,
Peter L. Hammer
Discrete Applied Mathematics
107
(1-3), 2000, pp. 1-26
On the relations between SAT and CSP enumerative algorithms
Richard Génisson
,
Philippe Jégou
Discrete Applied Mathematics
107
(1-3), 2000, pp. 27-40
Approximating a generalization of MAX 2SAT and MIN 2SAT
Dorit S. Hochbaum
,
Anu Pathria
Discrete Applied Mathematics
107
(1-3), 2000, pp. 41-59
General lower bounds on the query complexity within the exact learning model
Norbert Klasner
,
Hans Ulrich Simon
Discrete Applied Mathematics
107
(1-3), 2000, pp. 61-81
On subclasses of minimal unsatisfiable formulas
Hans Kleine Büning
Discrete Applied Mathematics
107
(1-3), 2000, pp. 83-98
Investigations on autark assignments
Oliver Kullmann
Discrete Applied Mathematics
107
(1-3), 2000, pp. 99-137
The influence of variables on pseudo-Boolean functions with applications to game theory and multicriteria decision making
Jean-Luc Marichal
Discrete Applied Mathematics
107
(1-3), 2000, pp. 139-164
Polyhedral structure of submodular and posi-modular systems
Hiroshi Nagamochi
,
Toshihide Ibaraki
Discrete Applied Mathematics
107
(1-3), 2000, pp. 165-189
Hardness of identifying the minimum ordered binary decision diagram
Yasuhiko Takenaga
,
Shuzo Yajima
Discrete Applied Mathematics
107
(1-3), 2000, pp. 191-201
Trading properties and Alexandrov kernels for Boolean functions
Alan D. Taylor
,
William S. Zwicker
Discrete Applied Mathematics
107
(1-3), 2000, pp. 203-214
Reflectiveness and compression of threshold transformations
Takao Ueda
Discrete Applied Mathematics
107
(1-3), 2000, pp. 215-224
Bounds and fast approximation algorithms for binary quadratic optimization problems with application to MAX 2SAT
Hans van Maaren
,
Joost P. Warners
Discrete Applied Mathematics
107
(1-3), 2000, pp. 225-239
Solving satisfiability problems using elliptic approximations - Effective branching rules
Joost P. Warners
,
Hans van Maaren
Discrete Applied Mathematics
107
(1-3), 2000, pp. 241-259