|
|
|
|
| LEADER |
00000cam a2200000 a 4500 |
| 001 |
74945 |
| 003 |
CZ-ZlUTB |
| 005 |
20251006170613.0 |
| 006 |
m d |
| 007 |
cr un |
| 008 |
130208s1989 mau sb 001 0 eng d |
| 020 |
|
|
|a 9780262256490
|q (ebook)
|
| 035 |
|
|
|a (OCoLC)827009311
|
| 040 |
|
|
|a IEEEE
|c IEEEE
|d OCLCF
|
| 100 |
1 |
|
|a Karchmer, Mauricio.
|
| 245 |
1 |
0 |
|a Communication complexity
|h [elektronický zdroj] :
|b a new approach to circuit depth /
|c Mauricio Karchmer.
|
| 260 |
|
|
|a Cambridge, Mass. :
|b MIT Press,
|c c1989.
|
| 300 |
|
|
|a 1 online zdroj (68 p.)
|
| 490 |
1 |
|
|a ACM doctoral dissertation awards ;
|v 1988
|
| 504 |
|
|
|a Bibliography: p. [65]-66.
|
| 500 |
|
|
|a Includes index.
|
| 506 |
|
|
|a Plný text je dostupný pouze z IP adres počítačů Univerzity Tomáše Bati ve Zlíně nebo vzdáleným přístupem pro zaměstnance a studenty univerzity
|
| 650 |
|
0 |
|a Algebra, Boolean.
|
| 650 |
|
0 |
|a Logic circuits.
|
| 650 |
|
0 |
|a Computational complexity.
|
| 650 |
|
0 |
|a Automatic theorem proving.
|
| 655 |
|
7 |
|a elektronické knihy
|7 fd186907
|2 czenas
|
| 655 |
|
9 |
|a electronic books
|2 eczenas
|
| 776 |
0 |
8 |
|i Print version:
|a Karchmer, Mauricio.
|t Communication complexity.
|d Cambridge, Mass. : MIT Press, c1989
|z 0262111438
|w (DLC) 89034499
|w (OCoLC)19810986
|
| 830 |
|
0 |
|a ACM doctoral dissertation award ;
|v 1988.
|
| 856 |
4 |
0 |
|u https://proxy.k.utb.cz/login?url=http://ieeexplore.ieee.org/xpl/bkabstractplus.jsp?bkn=6267292
|
| 992 |
|
|
|a BK
|c EBOOK-TN
|c MITPRESS
|
| 999 |
|
|
|c 74945
|d 74945
|
| 993 |
|
|
|x NEPOSILAT
|y EIZ
|
