Smoothing the Gap Between NP and ER (Q5071086): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Who Needs Crossings? Hardness of Plane Graph Rigidity / rank
 
Normal rank
Property / cites work
 
Property / cites work: The art gallery problem is ∃ ℝ-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms in real algebraic geometry / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random knapsack in expected polynomial time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for Reporting and Counting Geometric Intersections / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3750122 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some provably hard crossing number problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: COMPLEXITY AND REAL COMPUTATION: A MANIFESTO / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intersection graphs of rays and grounded segments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognition and complexity of point visibility graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Short propositional formulas represent nondeterministic computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time bounded random access machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of theorem-proving procedures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3413659 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A friendly smoothed analysis of the simplex method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2934725 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Smoothed Analysis of Local Search for the Maximum-Cut Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A short proof of Chvatal's Watchman Theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Surpassing the information theoretic bound with fusion trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Trans-dichotomous algorithms for minimum spanning trees and shortest paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: ETR-Completeness for Decision Versions of Multi-player (Symmetric) Nash Equilibria / rank
 
Normal rank
Property / cites work
 
Property / cites work: The computational complexity of knot and link problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Optimal Algorithm for Computing Visibility in the Plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sphere and dot product representations of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classroom examples of robustness problems in geometric computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upper bounds for sorting integers on random access machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4051879 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Drawing planar graphs with prescribed face areas / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2978407 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial upper bound on Reidemeister moves / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4071737 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recent progress in exact geometric computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust Proximity Queries: An Illustration of Degree-Driven Algorithm Design / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of drawing a graph in a polygonal region / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer realizations of disk and segment graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3819622 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discrete Dynamic Programming and Capital Allocation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3694703 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some undecidable problems involving elementary functions of a real variable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Realization spaces of 4-polytopes are universal / rank
 
Normal rank
Property / cites work
 
Property / cites work: On O(Tlog T) reduction from RAM computations to satisfiability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of Some Geometric and Topological Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Realizability of Graphs and Linkages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed points, Nash equilibria, and the existential theory of the reals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4197343 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Positive Semidefinite Matrix Factorization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3974991 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Smoothed analysis of algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4385524 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards exact geometric computation / rank
 
Normal rank

Latest revision as of 16:50, 28 July 2024

scientific article; zbMATH DE number 7510282
Language Label Description Also known as
English
Smoothing the Gap Between NP and ER
scientific article; zbMATH DE number 7510282

    Statements

    Smoothing the Gap Between NP and ER (English)
    0 references
    0 references
    0 references
    0 references
    20 April 2022
    0 references
    computational geometry
    0 references
    smoothed analysis
    0 references
    existential theory of the reals
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers