On the Complexity of the Horn Theory of REL

Please use this identifier to cite or link to this item: http://hdl.handle.net/1813/5612

Title:	On the Complexity of the Horn Theory of REL
Authors:	Hardin, Chris Kozen, Dexter
Keywords:	computer science technical report
Issue Date:	8-May-2003
Publisher:	Cornell University
Citation:	http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cis/TR2003-1896
Abstract:	We show that the universal Horn theory of relational Kleene algebras is Pi-1-1-complete.
URI:	http://hdl.handle.net/1813/5612
Appears in Collections:	Computing and Information Science Technical Reports

Files in This Item:

File	Size	Format
TR2003-1896.ps	174.96 kB	Postscript	View/Open