Year: 2008
Type: dissertation
Abstract: Motivation.In this thesis, I will explore the complexity of problems (A), (B), (A'), (B').This follows a twofold motivation:At first, in the age of highly-efficient computing devices, decidability is a very weak notion.As computing capacities increased, the theory of computing has become more and more demanding of the efficiency a problem is solvable with: From decidability, requirements have shifted to polynomial-time decidability, and are even further shifting towards efficient parallelizability.Thus Hilbert's question adapted to the concerns of this day and age could read: 'Are equivalence and representability polynomial-time decidable over some ring?'x * Speaking in a nit-picking fashion, there are two more exceptions: Whenever we speak of reductions, we implicitly make use of oracle machines; and the cryptographic protocols of Chapter 2 formally require interactive Turing machines.* Note that narrower definitions of the term 'negligible' occur in the literature as well.
Author: Hartung, Rupert
Institution: Goethe University Frankfurt
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W2182141780
