An \(O(nm)\)-time algorithm for computing the dual of a regular Boolean function (Q1327236): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q4773298 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Class of Polynomially Solvable Set-Covering Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An O(m n) algorithm for regular set-covering problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dualization of regular Boolean functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm to Dualize a Regular Switching Function / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3758559 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new polynomial-time algorithm for linear programming / 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: Q5607242 / rank
 
Normal rank

Revision as of 15:30, 22 May 2024

scientific article
Language Label Description Also known as
English
An \(O(nm)\)-time algorithm for computing the dual of a regular Boolean function
scientific article

    Statements

    An \(O(nm)\)-time algorithm for computing the dual of a regular Boolean function (English)
    0 references
    0 references
    0 references
    18 December 1994
    0 references
    dualizing a positive Boolean function
    0 references
    Hop-Skip-and-Jump algorithm
    0 references
    set- covering
    0 references

    Identifiers