Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > KEYWORD > HORN CLAUSE:
Reports tagged with Horn Clause:
TR06-082 | 18th June 2006
Prabhu Manyem

Polynomial-Time Maximisation Classes: Syntactic Hierarchy

In Descriptive Complexity, there is a vast amount of literature on
decision problems, and their classes such as \textbf{P, NP, L and NL}. ~
However, research on the descriptive complexity of optimisation problems
has been limited. In a previous paper [Man], we characterised
the optimisation versions of \textbf{P} via expressions ... more >>>




ISSN 1433-8092 | Imprint