Pages that link to "Item:Q3557891"

The following pages link to Complexity of Some Geometric and Topological Problems (Q3557891):

Displaying 50 items.

• Complexity of linear circuits and geometry (Q300885) (← links)
• Recognition and complexity of point visibility graphs (Q512262) (← links)
• Fixed points, Nash equilibria, and the existential theory of the reals (Q519892) (← links)
• \(P\) versus \(NP\) and geometry (Q607059) (← links)
• Simple realizability of complete abstract topological graphs in P (Q633211) (← links)
• Tractability conditions for numeric CSPs (Q683751) (← links)
• The complexity of tensor rank (Q722207) (← links)
• An introduction to geometric complexity theory (Q737196) (← links)
• Algorithmic complexity of a problem of idempotent convex geometry. (Q869763) (← links)
• Complexity of finite sequences of zeros and ones and geometry of finite spaces of functions (Q952226) (← links)
• The complexity of point configurations (Q1175788) (← links)
• Complexity of triangulations of the projective space. (Q1403825) (← links)
• \(\forall\exists\mathbb {R}\)-completeness and area-universality (Q1627164) (← links)
• Order on order types (Q1650795) (← links)
• Ham-sandwich cuts for abstract order types (Q1702128) (← links)
• The complexity of drawing a graph in a polygonal region (Q1725774) (← links)
• Computational complexity of multi-player evolutionarily stable strategies (Q2117070) (← links)
• Parameterized analysis and crossing minimization problems (Q2172859) (← links)
• On compatible triangulations with a minimum number of Steiner points (Q2192383) (← links)
• Treetopes and their graphs (Q2197683) (← links)
• Stick graphs with length constraints (Q2206824) (← links)
• Representing graphs and hypergraphs by touching polygons in 3D (Q2206825) (← links)
• Variants of the segment number of a graph (Q2206875) (← links)
• Computing exact solutions of consensus halving and the Borsuk-Ulam theorem (Q2221804) (← links)
• Termination of polynomial loops (Q2233526) (← links)
• Crossing numbers and combinatorial characterization of monotone drawings of \(K_n\) (Q2256586) (← links)
• Approximating the rectilinear crossing number (Q2331210) (← links)
• Realizing RCC8 networks using convex regions (Q2512988) (← links)
• On the complexity of recognizing Stick, BipHook and max point-tolerance graphs (Q2693628) (← links)
• Bit-complexity of classical solutions of linear evolutionary systems of partial differential equations (Q2693688) (← links)
• Approximating the Maximum Rectilinear Crossing Number (Q2817887) (← links)
• Contact Representations of Planar Graphs: Extending a Partial Representation is Hard (Q2945185) (← links)
• Approximating the Rectilinear Crossing Number (Q2961535) (← links)
• How to Draw a Planarization (Q2971142) (← links)
• On the Pseudolinear Crossing Number (Q2978177) (← links)
• On the Expressive Power of Query Languages for Matrices (Q3305355) (← links)
• The Complexity of Geometric Problems in High Dimension (Q3569062) (← links)
• (Q3754606) (← links)
• Some complexity results in topology and analysis (Q4314789) (← links)
• (Q4789204) (← links)
• The Complexity of Drawing a Graph in a Polygonal Region (Q5050006) (← links)
• Smoothing the Gap Between NP and ER (Q5071086) (← links)
• Crossing Numbers of Beyond-Planar Graphs Revisited (Q5084712) (← links)
• Computing Exact Solutions of Consensus Halving and the Borsuk-Ulam Theorem (Q5092341) (← links)
• A crossing lemma for multigraphs (Q5116525) (← links)
• Recognizing Stick Graphs with and without Length Constraints (Q5141646) (← links)
• Complexity of Geometric k-Planarity for Fixed k (Q5144878) (← links)
• Recognizing Visibility Graphs of Triangulated Irregular Networks (Q5164862) (← links)
• Hyperbolic Dimension and Decomposition Complexity (Q5216939) (← links)
• How to Draw a Planarization (Q5233140) (← links)