Tools

LEADER 02002nam a2200469 a 4500

001 ssj0000715528;

003 WaSeSS;

005 20231012080539.0;

006 m d ;

007 cr n ;

008 890509s1989 mau sb 00110 eng d;

010 a| 89034499 //r97;

020 a| 0262111438;

035 a| (WaSeSS)ssj0000715528;

040 a| DLCc| DLCd| DLCd| WaSeSS;

049 a| EREEa| NEHH;

050 00 a| QA10.3b| .K37 1989;

082 00 a| 511.3/242| 20;

100 10 a| Karchmer, Mauricio.=| ^A248052;

245 10 a| Communication complexityh| [electronic resource] :b| a new approach to circuit depth /c| Mauricio Karchmer.;

260 0 a| Cambridge, Mass. :b| MIT Press,;

300 a| 68 p. ;c| 24 cm.;

490 1 a| ACM doctoral dissertation awards ;v| 1988;

500 a| Includes index.;

504 a| Bibliography: p. [65]-66.;

506 a| Available only to authorized users.;

538 a| Mode of access: World Wide Web;

650 0 a| Algebra, Boolean.=| ^A20265;

650 0 a| Logic circuits.=| ^A33749;

650 0 a| Computational complexity.=| ^A74807;

650 0 a| Automatic theorem proving.=| ^A88007;

655 0 a| Electronic books.=| ^A491897;

830 0 a| ACM doctoral dissertation award ;v| 1988.=| ^A182477;

856 40 z| Full text available from MIT Press Direct to Open Backfile STEAM Monographs D2Ou| https://go.openathens.net/redirector/ecu.edu?url=https%3A%2F%2Fdoi.org%2F10.7551%2Fmitpress%2F1948.001.0001%3Flocatt%3Dmode%3Alegacy;

949 a| CLICK ON WEB ADDRESSw| ASISh| JOYNER188;

949 a| CLICK ON WEB ADDRESSw| ASISh| HSL77;

949 a| CLICK ON WEB ADDRESSw| ASISh| JMUSIC60;

596 a| 1 3 4;

998 a| 6255863;

999 a| CLICK ON WEB ADDRESSw| ASISc| 1i| 6255863-1001l| JNETm| JOYNERr| Ys| Yt| JNESSBKu| 10/14/2023x| EBOOKz| JERESOURCE;

999 a| CLICK ON WEB ADDRESSw| ASISc| 1i| 6255863-2001l| HSLELECm| HSLr| Ys| Yt| HEBKu| 10/14/2023x| EBOOKz| HERESOURCE;

999 a| CLICK ON WEB ADDRESSw| ASISc| 1i| 6255863-3001l| MNETm| JMUSICr| Ys| Yt| MNESSBKu| 10/14/2023x| EBOOKz| JERESOURCE;

Communication complexity a new approach to circuit depth / Mauricio Karchmer.

Author/creator	Karchmer, Mauricio
Format	Electronic
Publication Info	Cambridge, Mass. : MIT Press,
Description	68 p. ; 24 cm.
Supplemental Content	Full text available from MIT Press Direct to Open Backfile STEAM Monographs D2O
Subjects	Algebra, Boolean. Logic circuits. Computational complexity. Automatic theorem proving.

Series	ACM doctoral dissertation awards ; 1988 ACM doctoral dissertation award ; 1988. ^A182477
General note	Includes index.
Bibliography note	Bibliography: p. [65]-66.
Access restriction	Available only to authorized users.
Technical details	Mode of access: World Wide Web
Genre/form	Electronic books.
LCCN	89034499 //r97
ISBN	0262111438

Availability

Library	Location	Call Number	Status	Item Actions
	Electronic Resources	Access Content Online	✔ Available

Communication complexity a new approach to circuit depth / Mauricio Karchmer.

Click here for more information about this title

Availability