Login / Signup
The word problem for 1LC congruences is NP-hard.
Laurent Rosaz
Published in:
Theor. Comput. Sci. (2003)
Keyphrases
</>
word problems
np hard
similar problems
scheduling problem
approximation algorithms
lower bound
optimal solution
special case
computational complexity
grade students
multimedia
objective function
united states
computer aided