On Classifying Continuous Constraint Satisfaction Problems

4 June 2021

Papers citing "On Classifying Continuous Constraint Satisfaction Problems"

3 / 3 papers shown

Title
$Training Fully Connected Neural Networks is $\exists\mathbb{R}$-Complete$ Training Fully Connected Neural Networks is $\exists\mathbb{R}$ -Complete Daniel Bertschinger Christoph Hertrich Paul Jungeblut Tillmann Miltzow Simon Weber OffRL 85 30 0 04 Apr 2022
Covering Polygons is Even Harder Mikkel Abrahamsen 67 25 0 04 Jun 2021
On Restricted Nonnegative Matrix Factorization D. Chistikov S. Kiefer Ines Marusic M. Shirmohammadi J. Worrell 61 14 0 23 May 2016