The.Algorithm.Design.Manual.Springer-Verlag.1998
The.Algorithm.Design.Manual.Springer-Verlag.1998 The.Algorithm.Design.Manual.Springer-Verlag.1998
Index N neural networks - classification neural networks - coloring , newsgroups next subset Nobel Prize , noisy channels noisy images , nonapproximability results noncrossing drawing nondeterministic automata nonEuclidean distance metrics nonnumerical problems nonorthogonal kd-tree nonself intersecting polygons nonuniform access normal distribution notorious NP-complete problem NP , NP-completeness NP-completeness - definition of NP-completeness - proving NP-completeness - theory of NP-complete problem , , , NP-complete problem - bandwidth NP-complete problem - crossing number NP-complete problem - NFA minimization NP-complete problem - satisfiability NP-complete problem - set packing NP-complete problem - superstrings NP-complete problem - tetrahedralization NP-complete problem - tree drawing NP-complete problem - trie minimization NP-hard problems nuclear fission number field sieve number theory , file:///E|/BOOK/BOOK6/INDEX_N.HTM (2 of 3) [19/1/2003 1:32:59]
Index N numerical analysis numerical precision Numerical Recipes , numerical root finding numerical stability , Algorithms Tue Jun 3 11:59:42 EDT 1997 file:///E|/BOOK/BOOK6/INDEX_N.HTM (3 of 3) [19/1/2003 1:32:59]
- Page 673 and 674: Textbooks Next: On-Line Resources U
- Page 675 and 676: On-Line Resources Next: Literature
- Page 677 and 678: People Next: Software Up: On-Line R
- Page 679 and 680: Professional Consulting Services Ne
- Page 681 and 682: Index A Up: Index - All Index: A ab
- Page 683 and 684: Index A artists steal ASA ASCII asp
- Page 685 and 686: Index B binary representation - sub
- Page 687 and 688: Index C Up: Index - All Index: C C+
- Page 689 and 690: Index C clustering , , co-NP coding
- Page 691 and 692: Index C consulting services , conta
- Page 693 and 694: Index D Up: Index - All Index: D DA
- Page 695 and 696: Index D Dictionaries dictionaries -
- Page 697 and 698: Index D dynamic programming - appli
- Page 699 and 700: Index E empirical results - heurist
- Page 701 and 702: Index F Up: Index - All Index: F fa
- Page 703 and 704: Index F frequency domain friend-or-
- Page 705 and 706: Index G geometric shortest path , g
- Page 707 and 708: Index H Up: Index - All Index: H ha
- Page 709 and 710: Index H Algorithms Tue Jun 3 11:59:
- Page 711 and 712: Index I independent set - alternate
- Page 713 and 714: Index J Up: Index - All Index: J ji
- Page 715 and 716: Index K Algorithms Tue Jun 3 11:59:
- Page 717 and 718: Index L linear congruential generat
- Page 719 and 720: Index M Up: Index - All Index: M ma
- Page 721 and 722: Index M mindset minima minimax sear
- Page 723: Index N Up: Index - All Index: N na
- Page 727 and 728: Index O overlap graph overpasses -
- Page 729 and 730: Index P , , , , , , , , , , passwor
- Page 731 and 732: Index P polygons polygon triangulat
- Page 733 and 734: Index Q Up: Index - All Index: Q Qh
- Page 735 and 736: Index R ranking combinatorial objec
- Page 737 and 738: Index S Up: Index - All Index: S s-
- Page 739 and 740: Index S Shape Similarity shape simp
- Page 741 and 742: Index S solar year Solving Linear E
- Page 743 and 744: Index S straight-line graph drawing
- Page 745 and 746: Index T Up: Index - All Index: T ta
- Page 747 and 748: Index T trees - matching trees - pa
- Page 749 and 750: Index V Up: Index - All Index: V va
- Page 751 and 752: Index W Up: Index - All Index: W wa
- Page 753 and 754: Index Y Up: Index - All Index: Y Yo
- Page 755 and 756: Index (complete) Up: Index - All In
- Page 757 and 758: Index (complete) arm, robot around
- Page 759 and 760: Index (complete) binary search tree
- Page 761 and 762: Index (complete) center vertex, , C
- Page 763 and 764: Index (complete) compaction compari
- Page 765 and 766: Index (complete) counting paths, co
- Page 767 and 768: Index (complete) deletion from bina
- Page 769 and 770: Index (complete) dominance ordering
- Page 771 and 772: Index (complete) English to French
- Page 773 and 774: Index (complete) file directory tre
Index N<br />
neural networks - classification<br />
neural networks - coloring ,<br />
newsgroups<br />
next subset<br />
Nobel Prize ,<br />
noisy channels<br />
noisy images ,<br />
nonapproximability results<br />
noncrossing drawing<br />
nondeterministic automata<br />
nonEuclidean distance metrics<br />
nonnumerical problems<br />
nonorthogonal kd-tree<br />
nonself intersecting polygons<br />
nonuniform access<br />
normal distribution<br />
notorious NP-complete problem<br />
NP ,<br />
NP-completeness<br />
NP-completeness - definition of<br />
NP-completeness - proving<br />
NP-completeness - theory of<br />
NP-complete problem , , ,<br />
NP-complete problem - bandwidth<br />
NP-complete problem - crossing number<br />
NP-complete problem - NFA minimization<br />
NP-complete problem - satisfiability<br />
NP-complete problem - set packing<br />
NP-complete problem - superstrings<br />
NP-complete problem - tetrahedralization<br />
NP-complete problem - tree drawing<br />
NP-complete problem - trie minimization<br />
NP-hard problems<br />
nuclear fission<br />
number field sieve<br />
number theory ,<br />
file:///E|/BOOK/BOOK6/INDEX_N.HTM (2 of 3) [19/1/2003 1:32:59]
Change language