Finding Gale strings

zbMATH Open1274.90423MaRDI QIDQ2861535FDOQ2861535

Authors: Marta M. Casetti, Julian Merschen, Bernhard von Stengel 

Publication date: 8 November 2013

Full work available at URL: http://www.sciencedirect.com/science/article/pii/S1571065310001368

Recommendations

• String GUTs
• Strings
• Building GUTs from strings
• scientific article; zbMATH DE number 1615296
• Playing with patterns, searching for strings
• Pattern discovery in colored strings
• Pattern discovery in colored strings
• PROBING STRINGS FROM THE SKY
• String fine-tuning

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Cites Work

• Paths, Trees, and Flowers
• On the complexity of the parity argument and other inefficient proofs of existence
• Equilibrium Points of Bimatrix Games
• Title not available (Why is that?)
• The complexity of computing a Nash equilibrium
• Hard-to-Solve Bimatrix Games
• Lemke Paths on Simple Polytopes
• Simple complexity from imitation games
• Orientation in Complementary Pivot Algorithms
• Formality of the constructible derived category for spheres: a combinatorial and a geometric approach
• On generalizing shapley's index theory to labelled pseudomanifolds
• Euler complexes (oiks)

Cited In (3)

• Oriented Euler complexes and signed perfect matchings
• Exponentiality of the exchange algorithm for finding another room-partitioning
• Tropical Complementarity Problems and Nash Equilibria

This page was built for publication: Finding Gale strings

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2861535)