ZIB

Treffer pro Seite

Treffer 1 - 1 | 1 Treffer

Sortierung

Digitale Medien

A linear expected-time algorithm for deriving all logical conclusions implied by a set of boolean inequalities (1986)

Hansen, Pierre ; Jaumard, Brigitte ; Minoux, Michel

Springer

Mathematical programming 34 (1986), S. 223-231

zur Merkliste hinzufügen auf der Merkliste

Details

ISSN: 1436-4646

Schlagwort(e): Boolean Inequalities ; Implication Graph ; Depth-First Search ; Strongly Connected Components ; Transitive Closure ; 0–1 Programming

Quelle: Springer Online Journal Archives 1860-2000

Thema: Informatik , Mathematik

Notizen: Abstract Consider a setR ofm binary relations on a set ofn boolean variables.R may imply a contradiction, the fixation of some variables at 0 or at 1 and/or the identification of some pairs of variables in direct or complemented form. An O(n) expected-time algorithm is given for the derivation of all such logical conclusions. Computational experiments with problems involving up to 2000 variables are reported on. The proposed algorithm is more than 100 times faster than previous methods whenn ≥ 100.

Materialart: Digitale Medien

URL: http://dx.doi.org/10.1007/BF01580586

Permalink

Bibliothek	Standort	Signatur	Band/Heft/Jahr	Verfügbarkeit

Andere fanden auch interessant ...

Artikel (Nationallizenzen)

Volltext

Treffer 1 - 1 | 1 Treffer