Gap MCSP is not (Levin) NP-complete in Obfustopia.
Noam MazorRafael PassPublished in: Electron. Colloquium Comput. Complex. (2024)
Keyphrases
- np complete
- np hard
- randomly generated
- satisfiability problem
- constraint satisfaction problems
- computational complexity
- phase transition
- data complexity
- conjunctive queries
- data sets
- lower bound
- database
- low level
- expert systems
- computer vision
- sat problem
- pspace complete
- np complete problems
- polynomially solvable
- polynomial time complexity