CT-1996-01: van Emde Boas, Peter (1996) The Convenience of Tilings. [Report]
![[thumbnail of Full Text]](https://eprints.illc.uva.nl/style/images/fileicons/text.png) |
Text (Full Text)
CT-1996-01.text.ps.gz Download (145kB) |
|
Text (Abstract)
CT-1996-01.abstract.txt Download (1kB) |
Abstract
Tiling problems provide for a very simple and transparent mechanism for
encoding machine computations. This gives rise to rather simple master
reductions showing various versions of the tiling problem complete for
various complexity classes. We investigate the potential for using these
tiling problems in subsequent reductions showing hardness of the
combinatorial problems that really matter.
We ilustrate our approach by means of three examples: a short reduction chain
to the Knapsack problem followed by a Hilbert 10 reduction using similar
ingredients. Finally we reprove the Deterministic Exponential Time lowerbound
for satisfiability in Propositional Dynamic Logic.
The resulting reductions are relatively simple; they do however infringe on
the principle of orthogonality of reductions since they abuse extra structure
in the instances of the problems reduced from which results from the fact
that these instances were generated by a master reduction previously.
| Item Type: | Report |
|---|---|
| Report Nr: | CT-1996-01 |
| Series Name: | Computation and Complexity Theory (CT) |
| Year: | 1996 |
| Date Deposited: | 12 Oct 2016 14:39 |
| Last Modified: | 12 Oct 2016 14:39 |
| URI: | https://eprints.illc.uva.nl/id/eprint/1070 |
Actions (login required)
 |
View Item |
