Relating the Time Complexity of Optimization Problems in Light of the Exponential-Time Hypothesis (Q2922627): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / arXiv ID
 
Property / arXiv ID: 1406.3247 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Twice-Ramanujan Sparsifiers / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of soft constraint satisfaction / rank
 
Normal rank
Property / cites work
 
Property / cites work: On generating all solutions of generalized satisfiability problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of \(k\)-SAT / rank
 
Normal rank
Property / cites work
 
Property / cites work: Which problems have strongly exponential complexity? / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the algebraic structure of combinatorial problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Closure properties of constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of SAT Problems, Clone Theory and the Exponential Time Hypothesis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relating the Time Complexity of Optimization Problems in Light of the Exponential-Time Hypothesis / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Approximability of Constraint Satisfaction Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weak bases of Boolean co-clones / rank
 
Normal rank
Property / cites work
 
Property / cites work: Function Algebras on Finite Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4904144 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Two-Valued Iterative Systems of Mathematical Logic. (AM-5) / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Limits of Sparsification / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of satisfiability problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partial Polymorphisms and Constraint Satisfaction Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4414647 / rank
 
Normal rank

Latest revision as of 04:33, 9 July 2024

scientific article
Language Label Description Also known as
English
Relating the Time Complexity of Optimization Problems in Light of the Exponential-Time Hypothesis
scientific article

    Statements

    Identifiers

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