Show simple item record

dc.contributor.authorVazirani, Vijay V.en_US
dc.contributor.authorYannakakis, Mihalien_US
dc.date.accessioned2007-04-23T17:23:25Z
dc.date.available2007-04-23T17:23:25Z
dc.date.issued1987-11en_US
dc.identifier.citationhttp://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR87-886en_US
dc.identifier.urihttps://hdl.handle.net/1813/6726
dc.description.abstractThe following issues in computational complexity remain imprecisely understood: the striking difference in the complexities of computing the permanent and determinant of a matrix despite their similar looking formulae, the complexity of checking if a directed graph contains an even length cycle, and the complexity of computing the number of perfect matchings in a graph using Pfaffian orientations. Via polynomial time equivalences, we show inter-relationships among these issues.en_US
dc.format.extent1211550 bytes
dc.format.extent403739 bytes
dc.format.mimetypeapplication/pdf
dc.format.mimetypeapplication/postscript
dc.language.isoen_USen_US
dc.publisherCornell Universityen_US
dc.subjectcomputer scienceen_US
dc.subjecttechnical reporten_US
dc.titlePfaffian Orientations, 0/1 Permanents, and Even Cycles in Directed Graphsen_US
dc.typetechnical reporten_US


Files in this item

Thumbnail
Thumbnail

This item appears in the following Collection(s)

Show simple item record

Statistics