Incremental polynomial time dualization of quadratic functions and a subclass of degree-\(k\) functions (Q646712): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Complexity of identification and dualization of positive Boolean functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial-time inference of all valid implications for Horn and related formulae / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial-Time Recognition of 2-Monotonic Positive Boolean Functions Given by an Oracle / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dual subimplicants of positive Boolean functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dualization of regular Boolean functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3077976 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Identifying the Minimal Transversals of a Hypergraph and Related Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Double Horn functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognition and dualization of disguised bidual Horn functions. / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Results on Monotone Dualization and Generating Hypergraph Transversals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational aspects of monotone dualization: a brief survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Horn functions and submodular Boolean functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equational characterizations of Boolean function classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Complexity of Dualization of Monotone Disjunctive Normal Forms / rank
 
Normal rank
Property / cites work
 
Property / cites work: On generating all maximal independent sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4871262 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generating All Maximal Independent Sets: NP-Hardness and Polynomial-Time Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient dualization of \(O(\log n\))-term monotone disjunctive normal forms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Fast and Simple Algorithm for Identifying 2-Monotonic Positive Boolean Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithm Theory - SWAT 2004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial-time algorithms for regular set-covering and threshold synthesis / rank
 
Normal rank
Property / cites work
 
Property / cites work: An \(O(nm)\)-time algorithm for computing the dual of a regular Boolean function / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Problem of Simplifying Truth Functions / rank
 
Normal rank

Revision as of 15:30, 4 July 2024

scientific article
Language Label Description Also known as
English
Incremental polynomial time dualization of quadratic functions and a subclass of degree-\(k\) functions
scientific article

    Statements

    Incremental polynomial time dualization of quadratic functions and a subclass of degree-\(k\) functions (English)
    0 references
    17 November 2011
    0 references
    Boolean function
    0 references
    dualization
    0 references
    quadratic function
    0 references
    degree-\(k\) function
    0 references
    hypergraph transversal
    0 references
    polynomial total time algorithm
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers