Q5136330 (Q5136330): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.4230/LIPIcs.FSTTCS.2017.38 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3056948 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rigorous approximated determinization of weighted automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Price of Stability for Network Design with Fair Cost Allocation / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Map-Coloring Game / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alternation / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of theorem-proving procedures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3619797 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5624995 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Complexity of Timetable and Multicommodity Flow Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A BGP-based mechanism for lowest-cost routing / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Decision Procedure for the First Order Theory of Real Addition with Order / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4082296 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximal Flow Through a Network / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3292914 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4028471 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3352816 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new approach to the maximum-flow problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On saturation games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Number of quantifiers is better than number of tape cells / rank
 
Normal rank
Property / cites work
 
Property / cites work: Totally Balanced Games and Games of Flow / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic Game Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3576736 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4205072 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Possible Winners in Partially Completed Tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the combinational complexity of certain symmetric Boolean functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A strongly polynomial minimum cost circulation algorithm / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.4230/LIPICS.FSTTCS.2017.38 / rank
 
Normal rank

Latest revision as of 16:05, 30 December 2024

scientific article; zbMATH DE number 7278110
Language Label Description Also known as
English
No label defined
scientific article; zbMATH DE number 7278110

    Statements

    0 references
    0 references
    0 references
    25 November 2020
    0 references
    flow networks
    0 references
    two-player games
    0 references
    algorithms
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references