On the Expressive Power of Existential Quantification in Polynomial-Time Computability

by Dieter Spreen

User correction supplied by SystemCorrections

Datum	Value	Source
TITLE	On the Expressive Power of Existential Quantification in Polynomial-Time Computability	user correction - Legacy Corrections
AUTHOR NAME	Dieter Spreen	SVM HeaderParse 0.1
AUTHOR AFFIL	; Fachbereich Mathematik, Theoretische Informatik; Universitat Siegen; (Zero function) Z(x) = #.; (Successors) S 0 (x) = x0 and S 1 (x) = x1.	SVM HeaderParse 0.2
AUTHOR ADDR	; 57068 Siegen, Germany	SVM HeaderParse 0.1
ABSTRACT	this paper to study the expressive power of bounded existential quantification in polynomial-time computability. Our goal was to characterize nondeterministic polynomial-time computations in a machine-independent way. The following considerations are intended to make our idea clear. Let # be the finite alphabet	user correction - Legacy Corrections
CITATIONS	17 found	ParsCit 1.0