Extension complexity of formal languages (Q778518): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Created claim: Wikidata QID (P12): Q126864363, #quickstatements; #temporary_batch_1722379068559
 
(4 intermediate revisions by 4 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2988591986 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1603.07786 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exponential Lower Bounds for Polytopes in Combinatorial Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the extension complexity of combinatorial polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Matching Polytope has Exponential Extension Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Information-theoretic approximations of the nonnegative rank / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate Constraint Satisfaction Requires Large LP Relaxations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Limits of Linear Programs (Beyond Hierarchies) / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the existence of 0/1 polytopes with high semidefinite extension complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower Bounds on the Size of Semidefinite Programming Relaxations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some \(0/1\) polytopes need exponential size extended formulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lectures on Polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extended formulations in combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Disjunctive programming: Properties of the convex hull of feasible points / rank
 
Normal rank
Property / cites work
 
Property / cites work: Languages Simultaneously Complete for One-Way and Two-Way Log-Tape Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weak and strong one-way space complexity classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4836157 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The projected faces property and polyhedral relations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extended formulations, nonnegative factorizations, and randomized communication protocols / rank
 
Normal rank
Property / cites work
 
Property / cites work: Uncapacitated flow-based extended formulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tutorials on emerging methodologies and applications in operations research. Selected papers presented at INFORMS 2004, Denver, CO, USA, October 24--27, 2004. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some efficiently solvable problems over integer partition polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3046706 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Streaming algorithms for language recognition problems / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q126864363 / rank
 
Normal rank

Latest revision as of 23:38, 30 July 2024

scientific article
Language Label Description Also known as
English
Extension complexity of formal languages
scientific article

    Statements

    Extension complexity of formal languages (English)
    0 references
    0 references
    2 July 2020
    0 references
    formal languages
    0 references
    0 references
    0 references
    0 references

    Identifiers