Gap MCSP is not (Levin) NP-complete in Obfustopia.
Noam MazorRafael PassPublished in: IACR Cryptol. ePrint Arch. (2024)
Keyphrases
- np complete
- randomly generated
- constraint satisfaction problems
- computational complexity
- np hard
- pspace complete
- satisfiability problem
- polynomially solvable
- np complete problems
- sat problem
- conjunctive queries
- polynomial time complexity
- bounded treewidth
- phase transition
- temporal logic
- first order logic
- data complexity
- upper bound
- special case
- search algorithm
- bayesian networks
- feature selection
- database