Many bounded versions of undecidable problems are NP-hard Article Jun 29 Written by De las Cuevas group Author:Andreas KlinglerAuthor:Mirte van der EydenAuthor:Tobias ReinhartAuthor:Sebastian StengeleAuthor:Gemma De les Coves De las Cuevas group Previous Previous A framework for universality in physics, computer science and beyond Next Next Border Ranks of Positive and Invariant Tensor Decompositions: Applications to Correlations
Many bounded versions of undecidable problems are NP-hard Article Jun 29 Written by De las Cuevas group Author:Andreas KlinglerAuthor:Mirte van der EydenAuthor:Tobias ReinhartAuthor:Sebastian StengeleAuthor:Gemma De les Coves De las Cuevas group
