Fr. 256.40

Theory of Computational Complexity

English · Hardback

Shipping usually within 1 to 3 weeks (not available at short notice)

Description

Read more

This book is a comprehensive reference in computational complexity theory, and contains the complete treatment of the major topics, including Turing-machine based on complexity theory, NP-completeness theory, probabilistic complexity, decision tree complexity and circuit complexity.

Product details

Authors Ding-Zhu Du, Ding-Zhu Ko Du, Pre Athena Du, DU DING ZHU KO KER I, Ker-I Ko
Publisher Wiley, John and Sons Ltd
 
Languages English
Product format Hardback
Released 08.02.2000
 
EAN 9780471345060
ISBN 978-0-471-34506-0
No. of pages 512
Subject Natural sciences, medicine, IT, technology > Mathematics > Miscellaneous

Customer reviews

No reviews have been written for this item yet. Write the first review and be helpful to other users when they decide on a purchase.

Write a review

Thumbs up or thumbs down? Write your own review.

For messages to CeDe.ch please use the contact form.

The input fields marked * are obligatory

By submitting this form you agree to our data privacy statement.