Show simple item record

dc.contributor.authorHardin, Chrisen_US
dc.contributor.authorKozen, Dexteren_US
dc.date.accessioned2007-04-04T19:20:44Z
dc.date.available2007-04-04T19:20:44Z
dc.date.issued2003-05-08en_US
dc.identifier.citationhttp://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cis/TR2003-1896en_US
dc.identifier.urihttps://hdl.handle.net/1813/5612
dc.description.abstractWe show that the universal Horn theory of relational Kleene algebras is Pi-1-1-complete.en_US
dc.format.extent179155 bytes
dc.format.mimetypeapplication/postscript
dc.language.isoen_USen_US
dc.publisherCornell Universityen_US
dc.subjectcomputer scienceen_US
dc.subjecttechnical reporten_US
dc.titleOn the Complexity of the Horn Theory of RELen_US
dc.typetechnical reporten_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record

Statistics