A linear expected-time algorithm for deriving all logical conclusions implied by a set of boolean inequalities (Q3730348): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A linear-time algorithm for testing the truth of certain quantified Boolean formulas / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4132250 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Asymptotic Complexity of Matrix Multiplication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Large-Scale Zero-One Linear Programming Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logical Reduction Methods in Zero-One Programming—Minimal Preferred Variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3907407 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3050132 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A cascade algorithm for the logical closure of a set of binary relations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Uniquely solvable quadratic Boolean equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient algorithm for the transitive closure and a linear worst-case complexity result for a class of sparse graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Degree-two Inequalities, Clique Facets, and Biperfect Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear expected-time algorithms for connectivity problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient determination of the transitive closure of a directed graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: A transitive closure algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gaussian elimination is not optimal / rank
 
Normal rank
Property / cites work
 
Property / cites work: Depth-First Search and Linear Graph Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Theorem on Boolean Matrices / rank
 
Normal rank

Latest revision as of 15:08, 17 June 2024

scientific article
Language Label Description Also known as
English
A linear expected-time algorithm for deriving all logical conclusions implied by a set of boolean inequalities
scientific article

    Statements

    A linear expected-time algorithm for deriving all logical conclusions implied by a set of boolean inequalities (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    1986
    0 references
    0 references
    Boolean inequalities
    0 references
    implication graph
    0 references
    depth-first search
    0 references
    strongly connected components
    0 references
    transitive closure
    0 references
    0-1
    0 references
    programming
    0 references
    binary relations
    0 references
    Boolean variables
    0 references
    logical conclusion
    0 references