Integer factorization and Discrete Logarithm problem are neither in P nor NP-complete
Satoshi TazawaPublished in: CoRR (2012)
Keyphrases
- np complete
- group signature scheme
- elliptic curve
- np hard
- satisfiability problem
- computational complexity
- signature scheme
- randomly generated
- matrix factorization
- pairwise
- constraint satisfaction problems
- polynomial time complexity
- low rank
- conjunctive queries
- pspace complete
- polynomially solvable
- phase transition
- data complexity
- kronecker product
- elliptic curve cryptography
- np complete problems
- non rigid structure from motion
- linear combination
- binary matrix
- bounded treewidth
- cnf formula
- decision variables
- singular value decomposition