1999
Hardback (23 Jun 1999)
Save $5.68
Includes delivery to the United States
10+ copies available online - Usually dispatched within 7 days
An advanced textbook giving a broad, modern view of the computational complexity theory of boolean circuits, with extensive references, for theoretical computer scientists and mathematicians.
| ISBN: | 9783540643104 |
| Publisher: | Springer Berlin Heidelberg |
| Imprint: | Springer |
| Pub date: | 23 Jun 1999 |
| Edition: | 1999 |
| DEWEY: | 004 |
| DEWEY edition: | 22 |
| Language: | English |
| Number of pages: | 270 |
| Weight: | 1290g |
| Height: | 234mm |
| Width: | 156mm |
| Spine width: | 17mm |
$6.44off
Machine Learning
Hardback
Published 18 Sep 2012
Save $6.44
$16.53off
AI and Machine Learning for Cod...
Paperback
Published 16 Oct 2020
Save $16.53
$12.79off
Signals and Systems Using MATLAB
Paperback
Published 03 Sep 2024
Save $12.79
$3.03off
Smart Green Energy Production
Hardback
Published 30 Dec 2024
Save $3.03
$151.72off
Identification of Continuous-Ti...
Hardback
Published 28 Mar 2008
Save $151.72
$60.09off
The Design and Analysis of Comp...
Paperback
Published 01 Dec 2010
Save $60.09
$4.78off
The Sounds of Life
Paperback
Published 07 May 2024
Save $4.78
$1.45off
On the Future
Paperback
Published 05 Oct 2021
Save $1.45
$1.45off
The Universe in a Box
Paperback
Published 13 Jun 2024
Save $1.45
$14.90off
Numerical Techniques for Direct...
Paperback
Published 14 Jun 2017
Save $14.90