Tools

LEADER 05104cam 2200937 a 4500

001 ocm44937393;

003 OCoLC;

005 20260127093955.0;

008 000919s2000 gw b 001 0 eng d;

010 a| 00703237;

015 a| GBA0582732| bnb;

016 7 a| 9595676742| DE-101;

016 7 a| 0077565842| Uk;

019 a| 960129127a| 1172015673;

020 a| 3540410325q| (acid-free paper);

020 a| 9783540410324q| (acid-free paper);

024 3 a| 9783540410324;

029 1 a| AU@b| 000021819290;

029 1 a| AU@b| 000022197780;

029 1 a| DEBSZb| 086792946;

029 1 a| HEBISb| 09323032X;

029 1 a| NLGGCb| 202213358;

029 1 a| NZ1b| 6087225;

029 1 a| OHXb| har005136692;

029 1 a| UKMGBb| 007756584;

029 1 a| YDXCPb| 1711734;

035 a| (Sirsi) o44937393;

035 a| (OCoLC)44937393z| (OCoLC)960129127z| (OCoLC)1172015673;

042 a| lccopycat;

049 a| EREE;

050 00 a| QA267.7b| .T48 2000;

055 3 a| QA75b| .L38 no.1852;

072 7 a| QA2| lcco;

082 00 a| 511.32| 211| https://id.oclc.org/worldcat/ddc/E36FCxvRFypMfwwH9m83PkkHjp;

084 a| 54.102| bcl;

084 a| P 692| blsrissc;

090 a| QA169b| .T45 2000;

100 1 a| Thierauf, Thomas.1| https://id.oclc.org/worldcat/entity/E39PCjrxvpDHK6Pwyc8dp9VmcX=| ^A465802;

245 14 a| The computational complexity of equivalence and isomorphism problems /c| Thomas Thierauf.;

300 a| viii, 135 pages ;c| 24 cm.;

336 a| textb| txt2| rdacontent;

337 a| unmediatedb| n2| rdamedia;

338 a| volumeb| nc2| rdacarrier;

490 1 a| Lecture notes in computer science,x| 0302-9743 ;v| 1852;

504 a| Includes bibliographical references (pages 121-130) and index.;

530 a| Also available via the World Wide Web.;

505 0 a| Preliminaries -- Boolean Formulas and Circuits -- Branching Programs.;

520 a| A computational model is a framework for doing computations according to certain specified rules on some input data. These models come for example from automata theory, formal language theory, logic, or circuit theory. The computational power of such a model can be judged by evaluating certain problems with respect to that model. The theory of computations is the study of the inherent difficulty of computational problems, that is, their computational complexity. This monograph analyzes the computational complexity of the satisfiability, equivalence, and almost-equivalence problems with respect to various computational models. In particular, Boolean formulas, circuits, and various kinds of branching programs are considered.;

650 0 a| Computational complexityx| Data processing.=| ^A74807;

650 0 a| Isomorphisms (Mathematics)x| Data processing.=| ^A60954;

650 7 a| Computational complexityx| Data processing.2| fast0| (OCoLC)fst00871993;

650 7 a| Isomorphisms (Mathematics)x| Data processing.2| fast0| (OCoLC)fst00980193;

650 17 a| Fundamentele informatica.2| gtt;

650 17 a| Complexiteit.2| gtt;

650 17 a| Berekenbaarheid.2| gtt;

650 7 a| Teoria da computacao.2| larpcal;

650 7 a| Computational complexity.2| nli;

650 7 a| Isomorphisms (Mathematics)2| nli;

650 7 a| Complexité de calcul (informatique)2| ram;

650 7 a| Isomorphismes (mathématiques)x| Informatique.2| ram;

758 i| has work:a| The computational complexity of equivalence and isomorphism problems (Text)1| https://id.oclc.org/worldcat/entity/E39PCG79cxmX9gqVjq7YCrbBGd4| https://id.oclc.org/worldcat/ontology/hasWork;

830 0 a| Lecture notes in computer science ;v| 1852.=| ^A466336;

856 41 3| SpringerLinku| https://doi.org/10.1007/3-540-45303-2;

856 41 3| Table of contentsu| http://swbplus.bsz-bw.de/bsz086792946inh.htm;

856 41 u| http://link.springer-ny.com/link/service/series/0558/tocs/t1852.htmz| Restricted to Springer LINK subscribers;

856 41 u| http://link.springer.com/10.1007/3-540-45303-2z| eBook available for UOIT via SpringerLink. Click link to access;

856 42 3| Publisher descriptionu| http://catdir.loc.gov/catdir/enhancements/fy0816/00703237-d.html;

856 4 3| Coveru| http://swbplus.bsz-bw.de/bsz086792946cov.htm;

856 4 3| Kapitel 1u| http://swbplus.bsz-bw.de/bsz086792946kap.htm;

856 4 u| http://link.springer.de/link/service/series/0558/tocs/t1852.htmz| Accessible en INTRANET;

938 a| Ingram Library Servicesb| INGRn| in500384245;

938 a| Baker & Taylorb| BKTYc| 59.95d| 59.95i| 3540410325n| 0003608432s| active;

938 a| Baker and Taylorb| BTCPn| 00703237;

938 a| Otto Harrassowitzb| HARRn| har005136692;

938 a| YBP Library Servicesb| YANKn| 1711734;

994 a| C0b| ERE;

596 a| 1;

998 a| 776432;

999 a| QA169 .T45 2000w| LCc| 1i| 30372010931704d| 3/22/2013f| 3/22/2013g| 1l| JGESm| JOYNERp| $37.80r| Ys| Yt| JGESBKu| 12/15/2000x| BOOKz| JSTACKSo| .STAFF. 0;

The computational complexity of equivalence and isomorphism problems / Thomas Thierauf.

Author/creator	Thierauf, Thomas
Format	Book
Publication Info	Berlin ; New York : Springer, ©2000.
Description	viii, 135 pages ; 24 cm.
Supplemental Content	SpringerLink
Supplemental Content	Table of contents
Supplemental Content	Restricted to Springer LINK subscribers
Supplemental Content	eBook available for UOIT via SpringerLink. Click link to access
Supplemental Content	Publisher description
Supplemental Content	Cover
Supplemental Content	Kapitel 1
Supplemental Content	Accessible en INTRANET
Subjects	Computational complexity--Data processing. Isomorphisms (Mathematics)--Data processing.

Series	Lecture notes in computer science, 0302-9743 ; 1852 Lecture notes in computer science ; 1852. ^A466336
Contents	Preliminaries -- Boolean Formulas and Circuits -- Branching Programs.
Abstract	A computational model is a framework for doing computations according to certain specified rules on some input data. These models come for example from automata theory, formal language theory, logic, or circuit theory. The computational power of such a model can be judged by evaluating certain problems with respect to that model. The theory of computations is the study of the inherent difficulty of computational problems, that is, their computational complexity. This monograph analyzes the computational complexity of the satisfiability, equivalence, and almost-equivalence problems with respect to various computational models. In particular, Boolean formulas, circuits, and various kinds of branching programs are considered.
Bibliography note	Includes bibliographical references (pages 121-130) and index.
Other forms	Also available via the World Wide Web.
LCCN	00703237
ISBN	3540410325 (acid-free paper)
ISBN	9783540410324 (acid-free paper)
Standard identifier#	9783540410324

Availability

Library	Location	Call Number	Status	Item Actions
Joyner	General Stacks	QA169 .T45 2000	✔ Available	Place Hold

The computational complexity of equivalence and isomorphism problems / Thomas Thierauf.

Click here for more information about this title

Availability