Computability computational complexity guide (3 résultats)

Edité par Peking University Press
- Couverture souple
Vendeur : liu xing, Nanjing, JS, Chineliu xing
Contacter le vendeurVendeur avec une évaluation de 5 étoilesEtat: Neuf
EUR 63,23
EUR 16,00 expéditionExpédition depuis Chine vers Etats-UnisQuantité disponible : 1 disponible
paperback. Etat : 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 complexity. 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.…

- Couverture souple
Vendeur : liu xing, Nanjing, JS, Chineliu xing
Contacter le vendeurVendeur avec une évaluation de 5 étoilesEtat: Neuf
EUR 53,16
EUR 16,00 expéditionExpédition depuis Chine vers Etats-UnisQuantité disponible : 1 disponible
paperback. Etat : 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 and reference books. including three parts: computability. formal languages ??and automata. computational complexity. Introduces several computational model and their basic concepts of equivalence.…
- Couverture souple
Vendeur : liu xing, Nanjing, JS, Chineliu xing
Contacter le vendeurVendeur avec une évaluation de 5 étoilesEtat: Neuf
EUR 53,16
EUR 16,00 expéditionExpédition depuis Chine vers Etats-UnisQuantité disponible : 1 disponible
Ajouter au panierpaperback. Etat : 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 concepts 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.…