Author: Huang Wenqi
Publisher:
Publish Date: 2004-06-01
Features: This book proposes a practical and efficient solution approach for the substantial computational science problem of NP-hardness, thoroughly explains the concept of Turing machines to clarify why there are problems that are undecidable or computationally hard, and provides a realistic path to derive high-performance algorithms for NP problems.
Introduction to Modern Computation Theory: Background, Prospects, and Research on Solving Algorithms for NP-Hard Problems
📌 Related Posts
Literature
Quick test
2026-09-25
Literature
Computer Automated Reasoning and Intelligent Instruction
2026-09-26
Literature
Advanced structural materials
2026-09-26
Literature
Fitzgerald research
2026-09-19
Literature
English-Chinese Energy Engineering and Technology Vocabulary
2026-09-26
Literature
Zhongguo Dongwu Zhi Yiguo Yujiao
2026-09-26
Literature
Structural vibration control; Active, semi-active, and intelligent control
2026-09-26
Literature
Modern Physical Geography
2026-09-26