Advanced Search

MSC 2000:

*68Q25 Analysis of algorithms and problem complexity
68-02 Research monographs (computer science)
03D15 Complexity of computation
68R10 Graph theory in connection with computer science
94C15 Appl. of graph theory to circuits and networks
94C30 Appl. of design theory to circuits and networks
05A17 Partitions of integres (combinatorics)
68P20 Information storage and retrieval
68M20 Performance evaluation of computer systems, etc.
90C99 Mathematical programming
90B35 Scheduling theory
91A99 Game theory
68Q45 Formal languages
68T99 Artificial intelligence
68N99 Software

Keywords: NP-completeness; approximation algorithms; computational complexity; graph theory; network design; partitions; storage; retrieval; sequencing; scheduling; mathematical programming; algebra; number theory; games; puzzles; logic; automata; languages; program optimization; polynomial solvable problems

Cited in: Zbl 1218.68089 Zbl 1213.68337 Zbl 1229.90151 Zbl 1211.90199 Zbl 1227.05241 Zbl 1152.68445 Zbl 1135.68430 Zbl 1031.93165 Zbl 0998.68040 Zbl 0973.68264 Zbl 0960.90052 Zbl 0955.90038 Zbl 0940.68065 Zbl 0915.68072 Zbl 0885.90123 Zbl 0799.68183 Zbl 0787.05084 Zbl 0747.05072 Zbl 0729.05047 Zbl 0726.68007 Zbl 0719.90052 Zbl 0707.68016 Zbl 0725.68048 Zbl 0608.05026 Zbl 0605.68037 Zbl 0597.90046 Zbl 0592.90045 Zbl 0541.03035 Zbl 0503.68048 Zbl 0522.68040 Zbl 0505.68022 Zbl 0503.90053 Zbl 0498.03047 Zbl 0494.68050 Zbl 0494.68049 Zbl 0494.68048 Zbl 0493.00001 Zbl 0494.68047 Zbl 0456.90058 Zbl 0439.05017

Comment on this Item PDF MathML XML ASCII DVI PS BibTeX Online Ordering