Computability Computational Complexity Guide (3 results)
Published by Peking University Press
- Softcover
Seller: liu xing, Nanjing, JS, Chinaliu xing
Contact seller5-star sellerCondition: New
£ 52.51
£ 13.28 shippingShips from China to U.S.A.Quantity: 1 available
paperback. Condition: New. Paperback. Pub Date: 2011 08 Pages: 256 Language: English Publisher: University Press of computability and computational complexity guide (3rd edition) learning computational theory textbooks and reference books. including three part: computability. formal languages ??and automata. computational comple…xity. Form of language and its corresponding automaton model. time and space complexity introduces several computational model and their basic concepts of equivalence function. predicate and lan.
- Softcover
Seller: liu xing, Nanjing, JS, Chinaliu xing
Contact seller5-star sellerCondition: New
£ 44.15
£ 13.28 shippingShips from China to U.S.A.Quantity: 1 available
paperback. Condition: New. Paperback. Pub Date: 2004 07 Pages: 221 Language: English Publisher: Peking University Press universities computer professional and professional basic course textbook series: computability and computational complexity guide (2nd edition) learning theoretical computer science-based teaching materials an…d reference books. including three parts: computability. formal languages ??and automata. computational complexity. Introduces several computational model and their basic concepts of equivalence.
- Softcover
Seller: liu xing, Nanjing, JS, Chinaliu xing
Contact seller5-star sellerpaperback. Condition: New. Pub Date :2004-07-01 Publisher: Peking University Press book is learning the basis of theoretical computer science textbooks and reference books. including three parts: computability. formal languages ??and automata. computational complexity. Introduces several computational model and their basic conce…pts of equivalence function. predicate and languages ??computability form of language and its corresponding automaton model. the time and space complexity. NP completeness. etc. The book can be.
