On the Complexity of the Horn Theory of REL
| dc.contributor.author | Hardin, Chris | en_US |
| dc.contributor.author | Kozen, Dexter | en_US |
| dc.date.accessioned | 2007-04-04T19:20:44Z | |
| dc.date.available | 2007-04-04T19:20:44Z | |
| dc.date.issued | 2003-05-08 | en_US |
| dc.description.abstract | We show that the universal Horn theory of relational Kleene algebras is Pi-1-1-complete. | en_US |
| dc.format.extent | 179155 bytes | |
| dc.format.mimetype | application/postscript | |
| dc.identifier.citation | http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cis/TR2003-1896 | en_US |
| dc.identifier.uri | https://hdl.handle.net/1813/5612 | |
| dc.language.iso | en_US | en_US |
| dc.publisher | Cornell University | en_US |
| dc.subject | computer science | en_US |
| dc.subject | technical report | en_US |
| dc.title | On the Complexity of the Horn Theory of REL | en_US |
| dc.type | technical report | en_US |
Files
Original bundle
1 - 1 of 1