Fetching the paper…
Reading the bibliography…
A continuous constraint satisfaction problem (CCSP) is a constraint satisfaction problem (CSP) with an interval domain $U \subset \mathbb{R}$.
“A Universality Theorem for Nested Polytopes”
Michael Dobbins, Andreas Holmsen and Tillmann Miltzow · 1908
Earlier work this paper cites.
“Optimal Curve Straightening is ∃ ℝ \exists\mathbb{R} -Complete”
Jeff Erickson · 1908
Earlier work this paper cites.
“The Complexity of Positive Semidefinite Matrix Factorization”
Yaroslav Shitov · 1909
Earlier work this paper cites.
Mikkel Abrahamsen and Tillmann Miltzow · 1912
Earlier work this paper cites.
“The complexity of satisfiability problems”
Thomas. Schaefer · 1978
Earlier work this paper cites.
“Some algebraic and geometric computations in PSPACE”
John Canny · 1988
Earlier work this paper cites.
“The universality theorems on the classification problem of configuration varieties and convex polytopes varieties”
Nicolai Mnëv · 1988
Earlier work this paper cites.
“Stretchability of pseudolines is NP-hard”
Peter Shor · 1991
Earlier work this paper cites.
“Additive reducts of real closed fields”
David Marker, Ya’acov Peterzil and Anand Pillay · 1992
Earlier work this paper cites.
“A Structure Theorem for Semibounded Sets in the Reals”
Ya’acov Peterzil · 1992
Earlier work this paper cites.
“Complexity Of Neural Network Learning In The Real Number Model”
Xiao-Dong Zhang · 1992
Earlier work this paper cites.
“Reducts of Some Structures Over the Reals”
Ya’acov Peterzil · 1993
Earlier work this paper cites.
“Intersection graphs of segments”
Jan Kratochvíl and Jiří Matoušek · 1994
Earlier work this paper cites.
“Realization spaces of 4-polytopes are universal”
Jürgen Richter-Gebert and Günter. Ziegler · 1995
Earlier work this paper cites.
“Convex Optimization”
Stephen Boyd, Stephen. Boyd and Lieven Vandenberghe · 2004
Earlier work this paper cites.
“Improved dense packings of congruent squares in a square”
Thierry Gensane and Philippe Ryckelynck · 2005
Earlier work this paper cites.
“Parameterized complexity of constraint satisfaction problems” Also in CCC 2004
Dániel Marx · 2005
Earlier work this paper cites.
“On the complexity of numerical analysis”
Eric Allender, Peter Bürgisser, Johan Kjeldgaard-Pedersen and Peter Miltersen · 2006
Earlier work this paper cites.
“Algorithms in real algebraic geometry”
Saugata Basu, Richard Pollack and Marie-Françoise Roy · 2006
Earlier work this paper cites.
“A dichotomy theorem for constraint satisfaction problems on a 3-element set”
Andrei. Bulatov · 2006
Earlier work this paper cites.
“Semidefinite programming and arithmetic circuit evaluation” In Memory of Leonid Khachiyan (1952 - 2005 )
Sergey. Tarasov and Mikhail. Vyalyi · 2007
Earlier work this paper cites.
“Non-dichotomies in constraint satisfaction complexity”
Manuel Bodirsky and Martin Grohe · 2008
Earlier work this paper cites.
“An approximation trichotomy for Boolean #CSP”
Martin Dyer, Leslie Goldberg and Mark Jerrum · 2009
Cited alongside, same era.
“Complexity of some geometric and topological problems”
Marcus Schaefer · 2009
Cited alongside, same era.
“Bounding the radii of balls meeting every connected component of semi-algebraic sets” MEGA’2009
Saugata Basu and Marie-Françoise Roy · 2010
Cited alongside, same era.
“The complexity of temporal constraint satisfaction problems”
Manuel Bodirsky and Jan Kára · 2010
Cited alongside, same era.
“On the minimum of a positive polynomial over the standard simplex”
Gabriela Jeronimo and Daniel Perrucci · 2010
Cited alongside, same era.
“Sphere and dot product representations of graphs”
Ross Kang and Tobias Müller · 2011
Cited alongside, same era.
“ ∃ \exists R-Completeness for Decision Versions of Multi-player (Symmetric) Nash Equilibria”
Jugal Garg, Ruta Mehta, Vijay. Vazirani and Sadra Yazdanbod · 2018
Later among the works it cites.
“The Complexity of Tensor Rank”
Marcus Schaefer and Daniel Štefankovič · 2018
Later among the works it cites.
Mikkel Abrahamsen, Tillmann Miltzow and Nadja Seiferth · 2020
Later among the works it cites.
“A Proof of the CSP Dichotomy Conjecture”
Dmitriy Zhuk · 2020
Later among the works it cites.
“Covering Polygons is Even Harder”
Mikkel Abrahamsen · 2021
Closest in time.
“Training Neural Networks is ER-complete” Also in arXiv:2102.09798
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
“Essential convexity and complexity of semi-algebraic constraints”
Manuel Bodirsky, Peter Jonsson and Timo Von · 2012
Cited alongside, same era.
“Integer realizations of disk and segment graphs”
Colin McDiarmid and Tobias Müller · 2012
Cited alongside, same era.
“Realizability of graphs and linkages”
Marcus Schaefer · 2013
Cited alongside, same era.
“Intersection graphs of segments and ∃ ℝ \exists\mathbb{R} ”
Jiří Matoušek · 2014
Cited alongside, same era.
“A catalog of EXISTS-R-complete decision problems about Nash equilibria in multi-player games”
Vittorio Bilò and Marios Mavronicolas · 2016
Cited alongside, same era.
“On Restricted Nonnegative Matrix Factorization” arXiv:1605.06848
Dmitry Chistikov, Stefan Kiefer, Ines Marusic, Mahsa Shirmohammadi and James Worrell · 2016
Cited alongside, same era.
Mikkel Abrahamsen, Linda Kleist and Tillmann Miltzow · 2021
Closest in time.
“ ∃ ℝ \exists\mathbb{R} -complete Decision Problems about (Symmetric) Nash Equilibria in (Symmetric) Multi-player Games”
Vittorio Bilò and Marios Mavronicolas · 2021
Closest in time.
“Approximating the Existential Theory of the Reals”
Argyrios Deligkas, John Fearnley, Themistoklis Melissourgos and Paul. Spirakis · 2021
Closest in time.
“A Practical Algorithm with Performance Guarantees for the Art Gallery Problem”
Simon Hengeveld and Tillmann Miltzow · 2021
Closest in time.
“Complexity of Geometric k-Planarity for Fixed k”
Marcus Schaefer · 2021
Closest in time.
“The combined basic LP and affine IP relaxation for promise VCSPs on infinite domains”
Caterina Viola and Stanislav Živný · 2021
Closest in time.
“The Art Gallery Problem is ∃ ℝ \exists\mathbb{R} -complete” Also in STOC 2018, 65–73
Mikkel Abrahamsen, Anna Adamaszek and Tillmann Miltzow · 2022
Closest in time.
“On the computational complexity of decision problems about multi-player Nash equilibria”
Marieølbøll Berthelsen and Kristoffer Hansen · 2022
Closest in time.
“Smoothing the gap between NP and ER” Also in FOCS 2020
Jeff Erickson, Ivor van der Hoog and Tillmann Miltzow · 2022
Closest in time.
“Map Labelling is ∃ ℝ \exists\mathbb{R} -complete”
Fabian Klute and Tillmann Miltzow · 2022
Closest in time.
“The Complexity of Drawing a Graph in a Polygonal Region”
Anna Lubiw, Tillmann Miltzow and Debajyoti Mondal · 2022
Closest in time.
“The Point-Boundary Art Gallery Problem is ∃ ℝ \exists\mathbb{R} -hard”
Jack Stade · 2022
Closest in time.
“Training Fully Connected Neural Networks is ∃ ℝ \exists\mathbb{R} -Complete”
Daniel Bertschinger, Christoph Hertrich, Paul Jungeblut, Tillmann Miltzow and Simon Weber · 2023
Closest in time.
“Galois theory — Wikipedia, The Free Encyclopedia” [Online; accessed 7-July-2023], 2023
Wikipedia · 2023
Closest in time.
“The complete classification for quantified equality constraints”
Dmitriy Zhuk, Barnaby Martin and Michał Wrona · 2023
Closest in time.
“How do exponential size solutions arise in semidefinite programming?”
Gábor Pataki and Aleksandr Touzov · 2024
Closest in time.