The complexity of facets (and some facets of complexity) (Q1061485): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claims
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Christos H. Papadimitriou / rank
 
Normal rank
Property / author
 
Property / author: Mihalis Yannakakis / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0022-0000(84)90068-0 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2093454413 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Facets of the knapsack polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3892882 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3941433 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edmonds polytopes and weakly hamiltonian graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On certain polytopes associated with graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3844775 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solution of a Large-Scale Traveling-Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: New families of hypohamiltonian graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The edge inducibility of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Monotone Symmetric Travelling Salesman Problem: Hypohamiltonian/Hypotraceable Graphs and Facets / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the symmetric travelling salesman problem II: Lifting theorems and facets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel concepts in graph theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4142699 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The 3-Irreducible Partially Ordered Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3050157 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization problems and the polynomial hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Infinite Class of Hypohamiltonian Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Properties of vertex packing and independence system polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the facial structure of set packing polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4182528 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4739657 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hypohamiltonian and hypotraceable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterization problems for graphs, partially ordered sets, lattices, and families of sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3684168 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Further facet generating procedures for vertex packing polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of the Partial Order Dimension Problem / rank
 
Normal rank

Latest revision as of 17:30, 14 June 2024

scientific article
Language Label Description Also known as
English
The complexity of facets (and some facets of complexity)
scientific article

    Statements

    The complexity of facets (and some facets of complexity) (English)
    0 references
    1984
    0 references
    The authors introduce a certain complexity class \(D^ P\) connected with combinatorial optimization problems and in particular with the facets of polytopes. \(D^ P\) is the class of all languages that are the intersection of a language in NP and a language in coNP.
    0 references
    complexity class
    0 references
    combinatorial optimization
    0 references
    facets of polytopes
    0 references
    NP
    0 references
    coNP
    0 references

    Identifiers