Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > KEYWORD > SUCCINCT PROBLEMS:
Reports tagged with succinct problems:
TR95-048 | 5th October 1995
Helmut Veith

Succinct Representation and Leaf Languages


In this paper, we present stronger results in the theory of succinct
problem representation by boolean circuits, and establish a close
relationship between succinct problems and leaf languages. As
a major tool, we use quantifierfree projection reductions
from descriptive complexity theory.

In particular, we show that the succinct upgrading ... more >>>




ISSN 1433-8092 | Imprint