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=96-97
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Reactive local search techniques for the maximum
k
-conjunctive constraint satisfaction problem (MAX-
k
-CCSP)-CCSP)$
Roberto Battiti
,
Marco Protasi
Discrete Applied Mathematics
96-97
, 1999, pp. 3-27
Maximum renamable Horn sub-CNFs
Endre Boros
Discrete Applied Mathematics
96-97
, 1999, pp. 29-40
Satisfiability threshold for random XOR-CNF formulas
Nadia Creignou
,
Hervé Daude
Discrete Applied Mathematics
96-97
, 1999, pp. 41-53
Bidual Horn functions and extensions
Thomas Eiter
,
Toshihide Ibaraki
,
Kazuhisa Makino
Discrete Applied Mathematics
96-97
, 1999, pp. 55-88
An algorithm for the class of pure implicational formulas
John Franco
,
Judy Goldsmith
,
John Schlipf
,
Ewald Speckenmeyer
,
R.P. Swaminathan
Discrete Applied Mathematics
96-97
, 1999, pp. 89-106
A remark on random 2-SAT
Andreas Goerdt
Discrete Applied Mathematics
96-97
, 1999, pp. 107-110
The Multi-SAT algorithm
Jun Gu
Discrete Applied Mathematics
96-97
, 1999, pp. 111-126
The complexity of the falsifiability problem for pure implicational formulas
Peter Heusch
Discrete Applied Mathematics
96-97
, 1999, pp. 127-138
Resolution remains hard under equivalence
Hans Kleine Büning
,
Theodor Lettmann
Discrete Applied Mathematics
96-97
, 1999, pp. 139-148
On a generalization of extended resolution
O. Kullmann
Discrete Applied Mathematics
96-97
, 1999, pp. 149-176
The symmetry rule in propositional logic
Alasdair Urquhart
Discrete Applied Mathematics
96-97
, 1999, pp. 177-193
Complexity analysis of propositional resolution with autarky pruning
Allen van Gelder
Discrete Applied Mathematics
96-97
, 1999, pp. 195-221
Elliptic approximations of propositional formulae
Hans van Maaren
Discrete Applied Mathematics
96-97
, 1999, pp. 223-244
Accuracy of techniques for the logical analysis of data
Martin Anthony
Discrete Applied Mathematics
96-97
, 1999, pp. 247-257
From logical gates synthesis to chromatic bicritical clutters
C. Benzaken
Discrete Applied Mathematics
96-97
, 1999, pp. 259-305
Minimum self-dual decompositions of positive dual-minor Boolean functions
Jan C. Bioch
,
Toshihide Ibaraki
,
Kazuhisa Makino
Discrete Applied Mathematics
96-97
, 1999, pp. 307-326
Optimal sequential inspections of reliability systems subject to parallel-chain precedence constraints
Steve Y. Chiu
,
Louis A., Jr. Cox
,
Xiaorong Sun
Discrete Applied Mathematics
96-97
, 1999, pp. 327-336
On connected Boolean functions
Oya Ekin
,
Peter L. Hammer
,
Alexander Kogan
Discrete Applied Mathematics
96-97
, 1999, pp. 337-362
On generating the irredundant conjunctive and disjunctive normal forms of monotone Boolean functions
V. Gurvich
,
L. Khachiyan
Discrete Applied Mathematics
96-97
, 1999, pp. 363-373
Best second order bounds for two-terminal network reliability with dependent edge failures
Pierre Hansen
,
Brigitte Jaumard
,
Guy-Blaise Douanya Nguetse
Discrete Applied Mathematics
96-97
, 1999, pp. 375-393
Mixed logical-linear programming
J.N. Hooker
,
M.A. Osorio
Discrete Applied Mathematics
96-97
, 1999, pp. 395-442
Inner-core and outer-core functions of partially defined Boolean functions
Kazuhisa Makino
,
Toshihide Ibaraki
Discrete Applied Mathematics
96-97
, 1999, pp. 443-460
Semidefinite programming relaxations for the graph partitioning problem
Henry Wolkowicz
,
Qing Zhao
Discrete Applied Mathematics
96-97
, 1999, pp. 461-479