Complexity of problems in games, graphs and algebraic equations (Q1137948): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4773298 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5679731 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3277097 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A remark on a problem of Harary / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4099541 / rank
 
Normal rank
Property / cites work
 
Property / cites work: From Nim to Go / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory of annihilation games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4144192 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4157951 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs and composite games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5795154 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 03:37, 13 June 2024

scientific article
Language Label Description Also known as
English
Complexity of problems in games, graphs and algebraic equations
scientific article

    Statements

    Complexity of problems in games, graphs and algebraic equations (English)
    0 references
    0 references
    0 references
    1979
    0 references
    board games
    0 references
    existence of solutions of algebraic equations
    0 references
    combinatorial game theory
    0 references
    computational complexity
    0 references
    NP-hard games
    0 references
    NP-complete graph problems
    0 references
    NP-complete abstract algebraic problems
    0 references
    classical NP-hard abstract algebraic problems
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references