Art

J-GLOBAL ID：201002200834071268   Reference number：10A0950338

Entropy as Computational Complexity

計算の複雑さとしてのエントロピー

Author (2)： TAKAOKA Tadao (Dep. of Computer Sci. and Software Engineering Univ. of Canterbury) ,  NAKAGAWA Yuji (School of Informatics Kansai Univ.)
Material： Journal of Information Processing (Web)  (J Inf Proc (Web))
Volume： 18  Page： 227-241 (J-STAGE)  Publication year： 2010 
JST Material Number： U0109A  ISSN： 1882-6652  Document type： Article
Article type： 原著論文  Country of issue： Japan (JPN)  Language： ENGLISH (EN)

Thesaurus term： *Entropy ,  *computational complexity ,  man-hour ,  *Uncertainty ,  measure ,  merging (computer) ,  sorting (computer) ,  shortest route problem ,  spanning tree ,  algorithm
Semi thesaurus term： quicksort ,  sorting ,  *computational complexity ,  minimization

JST classification (1)： Other system programmings  (JD03070M)

Reference (14)：

• 1) Nakagawa, Y.: A Difficulty Estimation Method for Multidimensional Nonlinear 0-1 Knapsack Problem Using Entropy, Trans. Institute of Electronics, Communication and Information, Vol.J87-A, No.3, pp.406-408 (2004).
• 2) Takaoka, T.: Entropy-Measure of Disorder, Proc. CATS (Computation: Australasian Theory Symposium), pp.77-85 (1998).
• 3) Takaoka, T.: Partial Solution and Entropy, MFCS 2009, LNCS 5734, pp.700-711 (2009).
• 4) Estivill-Castro, V. and Wood, D.: A survey of adaptive sorting algorithms, ACM Computing Surveys 24, pp.441-476 (1992).
• 5) Knuth, D.E.: The Art of Computer Programming, Vol.3, Sorting and Searching, Reading, Mass., Addison-Wesley (1974).

Terms in the title (2)： 計算の複雑さ ,  エントロピー