Limited access: U-M users only
Access by request
Access via HathiTrust
Access via FulcrumGraph Complexity and Slice Functions
| dc.contributor.author | Lokam, V. | en_US |
| dc.date.accessioned | 2006-09-08T20:15:39Z | |
| dc.date.available | 2006-09-08T20:15:39Z | |
| dc.date.issued | 2003-01-20 | en_US |
| dc.identifier.citation | V. Lokam,; (2003). "Graph Complexity and Slice Functions ." Theory of Computing Systems 36(1): 71-88. <http://hdl.handle.net/2027.42/42364> | en_US |
| dc.identifier.issn | 1432-4350 | en_US |
| dc.identifier.uri | https://hdl.handle.net/2027.42/42364 | |
| dc.description.abstract | Abstract. A graph-theoretic approach to study the complexity of Boolean functions was initiated by Pudlák, Rödl, and Savický [PRS] by defining models of computation on graphs. These models generalize well-known models of Boolean complexity such as circuits, branching programs, and two-party communication complexity. | en_US |
| dc.format.extent | 142775 bytes | |
| dc.format.extent | 3115 bytes | |
| dc.format.mimetype | application/pdf | |
| dc.format.mimetype | text/plain | |
| dc.language.iso | en_US | |
| dc.publisher | Springer-Verlag; Springer-Verlag New York Inc. | en_US |
| dc.subject.other | Legacy | en_US |
| dc.title | Graph Complexity and Slice Functions | en_US |
| dc.type | Article | en_US |
| dc.subject.hlbsecondlevel | Mathematics | en_US |
| dc.subject.hlbtoplevel | Science | en_US |
| dc.description.peerreviewed | Peer Reviewed | en_US |
| dc.contributor.affiliationum | EECS Department, University of Michigan, Ann Arbor, MI 48109-2122, USA satyalv@eecs.umich.edu, US | en_US |
| dc.contributor.affiliationumcampus | Ann Arbor | en_US |
| dc.description.bitstreamurl | http://deepblue.lib.umich.edu/bitstream/2027.42/42364/1/30360071.pdf | en_US |
| dc.identifier.doi | http://dx.doi.org/10.1007/s00224-002-1068-0 | en_US |
| dc.identifier.source | Theory of Computing Systems | en_US |
| dc.owningcollname | Interdisciplinary and Peer-Reviewed |
Files in this item
Remediation of Harmful Language
The University of Michigan Library aims to describe library materials in a way that respects the people and communities who create, use, and are represented in our collections. Report harmful or offensive language in catalog records, finding aids, or elsewhere in our collections anonymously through our metadata feedback form. More information at Remediation of Harmful Language.
Accessibility
If you are unable to use this file in its current format, please select the Contact Us link and we can modify it to make it more accessible to you.