Lattice point methods for combinatorial games (Q534200): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q3433876 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Short rational generating functions for lattice point problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3944542 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4762155 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for lattice games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3239652 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decompositions of commutative monoid congruences and binomial ideals. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial Commutative Algebra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5697065 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Misère quotients for impartial games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lectures on Polytopes / rank
 
Normal rank

Revision as of 02:09, 4 July 2024

scientific article
Language Label Description Also known as
English
Lattice point methods for combinatorial games
scientific article

    Statements

    Lattice point methods for combinatorial games (English)
    0 references
    0 references
    0 references
    17 May 2011
    0 references
    combinatorial game
    0 references
    normal play
    0 references
    misère play
    0 references
    affine semigroup
    0 references
    convex polyhedron
    0 references
    generating function
    0 references

    Identifiers