N (set of natural numbers),
1070
naive algorithm for string matching,
909-911
and difference constraints,
603
and relaxation, 613 ex.
nondeterministic polynomial time,
981 n.
nonnegativity constraint,
777,
779
nonoverlappable string pattern,
922 ex.
nontrivial square root of 1, modulo
n,
878
of the circuit-satisfiability problem,
987-994
of determining whether a boolean formula is a tautology,
1002 ex.
of the formula-satisfiability problem,
996-998
of the graph-coloring problem,
1019 pr.
of the half 3-CNF satisfiability problem,
1018 ex.
of the hamiltonian-cycle problem,
1008-1012
of the hamiltonian-path problem,
1017 ex.
of the independent-set problem,
1018 pr.
of the integer linear-programming problem,
1017 ex.
of the longest-simple-cycle problem,
1017 ex.
proving, of a language,
995-996
of scheduling with profits and deadlines,
1020 pr.
of the set-covering problem,
1038 ex.
of the set-partition problem,
1017 ex.
of the subgraph-isomorphism problem,
1017 ex.
of the 3-CNF-satisfiability problem,
998-1002
of the traveling-salesman problem,
1012-1013
of the 0-1 integer-programming problem,
1017 ex.