Q2741527 (Q2741527): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 2 users not shown)
Property / author
 
Property / author: Harry B. III Hunt / rank
Normal rank
 
Property / author
 
Property / author: Madhav V. Marathe / rank
Normal rank
 
Property / author
 
Property / author: Harry B. III Hunt / rank
 
Normal rank
Property / author
 
Property / author: Madhav V. Marathe / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3994881 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proof verification and the hardness of approximation problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4258216 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebraic Structures with Hard Equivalence and Minimization Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complete problems for space bounded subclasses of NP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Building tractable disjunctive constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4259979 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random Debaters and the Hardness of Approximating Stochastic Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A dichotomy theorem for maximum generalized satisfiability problems. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monotone monadic SNP and constraint satisfaction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of problems in games, graphs and algebraic equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3002852 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strongly-local reductions and the complexity/efficient approximability of algebra and optimization on abstract algebraic structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic Algorithms for Deciding Equivalence of Straight-Line Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Closure properties of constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4526965 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial Space Counting Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The correlation between the complexities of the nonhierarchical and hierarchical versions of graph problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient solutions of hierarchical systems of linear equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planar Formulae and Their Uses / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization complexity of linear logic proof games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2751046 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bandwidth contrained NP-complete problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Algorithms for PSPACE-Hard Hierarchically and Periodically Specified Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Games against nature / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization, approximation, and complexity classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4298260 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantifiers and approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of satisfiability problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Unapproximable Versions of $NP$-Complete Problems / rank
 
Normal rank

Latest revision as of 18:51, 3 June 2024

scientific article
Language Label Description Also known as
English
No label defined
scientific article

    Statements

    0 references
    0 references
    0 references
    24 September 2001
    0 references
    complexity
    0 references
    efficient approximability
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references