Login / Signup
The Perkins Semigroup has Co-Np-Complete Term-Equivalence Problem.
Steve Seif
Published in:
Int. J. Algebra Comput. (2005)
Keyphrases
</>
np complete
randomly generated
np hard
satisfiability problem
constraint satisfaction problems
logical equivalence
computational complexity
pspace complete
search algorithm
phase transition
regularization term
equivalence relation
bounded treewidth
polynomially solvable