Weizmann Logo
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style

All reports by Author Arnaldo Moura:

TR09-025 | 11th March 2009
Arnaldo Moura, Igor Carboni Oliveira

A New Look at Some Classical Results in Computational Complexity

We propose a generalization of the traditional algorithmic space and
time complexities. Using the concept introduced, we derive an
unified proof for the deterministic time and space hierarchy
theorems, now stated in a much more general setting. This opens the
possibility for the unification and generalization of other results
that ... more >>>

ISSN 1433-8092 | Imprint