Boolean Function Complexity
Saved in:
| Title: | Boolean Function Complexity |
|---|---|
| Description: | By considering the size of the logical network needed to perform a given computational task, the intrinsic difficulty of that task can be examined. Boolean function complexity, the combinatorial study of such networks, is a subject that started back in the 1950s and has today become one of the most challenging and vigorous areas of theoretical computer science. The papers in this book stem from the London Mathematical Society Symposium on Boolean Function Complexity held at Durham University in July 1990. The range of topics covered will be of interest to the newcomer to the field as well as the expert, and overall the papers are representative of the research presented at the Symposium. Anyone with an interest in Boolean Function complexity will find that this book is a necessary purchase. |
| Authors: | M. S. Paterson |
| Resource Type: | eBook. |
| Subjects: | Computational complexity--Congresses, Algebra, Boolean |
| Categories: | MATHEMATICS / Algebra / General |
| Database: | eBook Collection (EBSCOhost) |
| FullText | Links: – Type: ebook-pdf Text: Availability: 0 |
|---|---|
| Header | DbId: nlebk DbLabel: eBook Collection (EBSCOhost) An: 552529 RelevancyScore: 959 AccessLevel: 6 PubType: eBook PubTypeId: ebook PreciseRelevancyScore: 959.155151367188 |
| IllustrationInfo | |
| ImageInfo | – Size: thumb Target: https://rps2images.ebscohost.com/rpsweb/othumb?id=NL$552529$PDF&s=r – Size: medium Target: https://rps2images.ebscohost.com/rpsweb/othumb?id=NL$552529$PDF&s=d |
| Items | – Name: Title Label: Title Group: Ti Data: Boolean Function Complexity – Name: Abstract Label: Description Group: Ab Data: By considering the size of the logical network needed to perform a given computational task, the intrinsic difficulty of that task can be examined. Boolean function complexity, the combinatorial study of such networks, is a subject that started back in the 1950s and has today become one of the most challenging and vigorous areas of theoretical computer science. The papers in this book stem from the London Mathematical Society Symposium on Boolean Function Complexity held at Durham University in July 1990. The range of topics covered will be of interest to the newcomer to the field as well as the expert, and overall the papers are representative of the research presented at the Symposium. Anyone with an interest in Boolean Function complexity will find that this book is a necessary purchase. – Name: Author Label: Authors Group: Au Data: <searchLink fieldCode="AR" term="%22M%2E+S%2E+Paterson%22">M. S. Paterson</searchLink> – Name: TypePub Label: Resource Type Group: TypPub Data: eBook. – Name: Subject Label: Subjects Group: Su Data: <searchLink fieldCode="DE" term="%22Computational+complexity--Congresses%22">Computational complexity--Congresses</searchLink><br /><searchLink fieldCode="DE" term="%22Algebra%2C+Boolean%22">Algebra, Boolean</searchLink> – Name: SubjectBISAC Label: Categories Group: Su Data: <searchLink fieldCode="ZK" term="%22MATHEMATICS+%2F+Algebra+%2F+General%22">MATHEMATICS / Algebra / General</searchLink> |
| PLink | https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=nlebk&AN=552529 |
| RecordInfo | BibRecord: BibEntity: Classifications: – Code: 511.324 Scheme: ddc Type: prePub Languages: – Code: eng Text: English Subjects: – SubjectFull: Computational complexity--Congresses Type: general – SubjectFull: Algebra, Boolean Type: general Titles: – TitleFull: Boolean Function Complexity Type: main BibRelationships: HasContributorRelationships: – PersonEntity: Name: NameFull: M. S. Paterson – PersonEntity: Name: NameFull: M. S. Paterson IsPartOfRelationships: – BibEntity: Dates: – D: 01 M: 01 Type: published Y: 1992 – D: 04 M: 02 Type: profile Y: 2014 Identifiers: – Type: isbn-print Value: 9780521408264 – Type: isbn-electronic Value: 9781107361720 Numbering: – Type: volume Value: 00169 Titles: – TitleFull: Boolean Function Complexity Type: main |
| ResultId | 1 |
