On the Complexity of the Decisive Problem in Simple and Weighted Games (Q2840677): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
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: A linear time algorithm for recognizing regular Boolean functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5655273 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conjuncturally Stable Coalition Structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stability of two player game structures / 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: Q4700639 / rank
 
Normal rank

Latest revision as of 16:26, 6 July 2024

scientific article
Language Label Description Also known as
English
On the Complexity of the Decisive Problem in Simple and Weighted Games
scientific article

    Statements

    On the Complexity of the Decisive Problem in Simple and Weighted Games (English)
    0 references
    0 references
    0 references
    23 July 2013
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    simple/weighted game
    0 references
    hypergraph
    0 references
    self-duality
    0 references
    quasi-polynomial
    0 references
    0 references
    0 references