On functions computable in nondeterministic polynomial time: some characterizations, in: E. Borger et al., eds (1988)

by D Spreen
Venue:CSL'87, 1st Workshop on Computer Science Logic, Proc., Lec. Notes Comput. Sci. 329
Add To MetaCart
Results 1 - 1 of 1

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

by Dieter Spreen
"... 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 fin ..."
Abstract - Add to MetaCart
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