Computational aspects of the colorful Carathéodory theorem (Q1991350): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4421940 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Very colorful theorems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A generalization of Caratheodory's theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Colourful Linear Programming and its Relatives / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating Nash Equilibria and Dense Bipartite Subgraphs via an Approximate Version of Caratheodory's Theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time bounds for selection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5501289 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of pure Nash equilibria / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing a centerpoint of a finite planar set of points in linear time / rank
 
Normal rank
Property / cites work
 
Property / cites work: How easy is local search? / rank
 
Normal rank
Property / cites work
 
Property / cites work: The polynomial solvability of convex quadratic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4530626 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On total functions, existence theorems and computational complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Further Generalization of the Colourful Carathéodory Theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Rainbow at the End of the Line — A PPAD Formulation of the Colorful Carathéodory Theorem with Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Colorful linear programming, Nash equilibrium, and pivots / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theoretical aspects of local search. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate centerpoints with proofs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating Tverberg points in linear time for any fixed dimension / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of the Lin–Kernighan Heuristic for the Traveling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3992847 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Theorem on General Measure / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partitions of points into simplices with \(k\)-dimensional intersection. I: The conic Tverberg's theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tverberg's theorem via number fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple Local Search Problems that are Hard to Solve / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Generalization of Radon's Theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A generalization of Radon's theorem II / rank
 
Normal rank
Property / cites work
 
Property / cites work: On generalizations of Radon's theorem and the Ham sandwich theorem / rank
 
Normal rank

Latest revision as of 04:04, 17 July 2024

scientific article
Language Label Description Also known as
English
Computational aspects of the colorful Carathéodory theorem
scientific article

    Statements

    Computational aspects of the colorful Carathéodory theorem (English)
    0 references
    0 references
    0 references
    30 October 2018
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    colorful Carathéodory theorem
    0 references
    PLS
    0 references
    approximation
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references