Index (English)
In:
DISCRETE APPLIED MATHEMATICS
;
96
, 1-3
;
481-482
;
1999
-
ISSN:
- Article (Journal) / Print
-
Title:Index
-
Published in:DISCRETE APPLIED MATHEMATICS ; 96, 1-3 ; 481-482
-
Publisher:
- New search for: ELSEVIER
-
Publication date:1999-01-01
-
Size:2 pages
-
ISSN:
-
Type of media:Article (Journal)
-
Type of material:Print
-
Language:English
- New search for: 510
- Further information on Dewey Decimal Classification
-
Classification:
DDC: 510 -
Source:
© Metadata Copyright the British Library Board and other contributors. All rights reserved.
Table of contents – Volume 96, Issue 1-3
The tables of contents are generated automatically and are based on the data records of the individual contributions available in the index of the TIB portal. The display of the Tables of Contents may therefore be incomplete.
- 1
-
Editorial(s)| 1999
- 3
-
Reactive local search techniques for the maximum k-conjunctive constraint satisfaction problem (MAX-k-CCSP)Battiti, R. / Protasi, M. et al. | 1999
- 29
-
Maximum renamable Horn sub-CNFsBoros, E. et al. | 1999
- 41
-
Satisfiability threshold for random XOR-CNF formulasCreignou, N. / Daude, H. et al. | 1999
- 55
-
Bidual Horn functions and extensions - optimal compressionEiter, T. / Ibaraki, T. / Makino, K. et al. | 1999
- 89
-
An algorithm for the class of pure implicational formulasFranco, J. / Goldsmith, J. / Schlipf, J. / Speckenmeyer, E. / Swaminathan, R.P. et al. | 1999
- 107
-
A remark on random 2-SATGoerdt, A. et al. | 1999
- 111
-
The Multi-SAT algorithmGu, J. et al. | 1999
- 127
-
The complexity of the falsifiability problem for pure implicational formulasHeusch, P. et al. | 1999
- 139
-
Resolution remains hard under equivalenceBuning, H.K. / Lettmann, T. et al. | 1999
- 149
-
On a generalization of extended resolutionKullmann, O. et al. | 1999
- 177
-
The symmetry rule in propositional logicUrquhart, A. et al. | 1999
- 195
-
Complexity analysis of propositional resolution with autarky pruningVan Gelder, A.A. et al. | 1999
- 223
-
Elliptic approximations of propositional formulaevan Maaren, H. et al. | 1999
- 247
-
Accuracy of techniques for the logical analysis of dataAnthony, M. et al. | 1999
- 259
-
From logical gates synthesis to chromatic bicritical cluttersBenzaken, C. et al. | 1999
- 307
-
Minimum self-dual decompositions of positive dual-minor Boolean functionsBioch, J.C. / Ibaraki, T. / Makino, K. et al. | 1999
- 327
-
Optimal sequential inspections of reliability systems subject to parallel-chain precedence constraintsChiu, S.Y. / Jr., L.A.C. / Sun, X. et al. | 1999
- 337
-
On connected Boolean functionsEkin, O.O. / Hammer, P.L.P.L. / Kogan, A. et al. | 1999
- 363
-
On generating the irredundant conjunctive and disjunctive normal forms of monotone Boolean functionsGurvich, V. / Khachiyan, L. et al. | 1999
- 375
-
Best second order bounds for two-terminal network reliability with dependent edge failuresHansen, P. / Jaumard, B. / Nguetse, G.-B.D. et al. | 1999
- 395
-
Mixed logical-linear programmingHooker, J.N. / Osorio, M.A. et al. | 1999
- 443
-
Inner-core and outer-core functions of partially defined Boolean functionsMakino, K. / Ibaraki, T. et al. | 1999
- 461
-
Semidefinite programming relaxations for the graph partitioning problemWolkowicz, H. / Zhao, Q. et al. | 1999
- 481
-
Index| 1999