Abstract
We show that if every NP set in polynomial-time bounded truth-table reducible to some P-selective set, then NP is contained in DTIME (2 nO(1/ √ logn) . In the proof, we implement a recursive procedure that reduces the number of nondeterministic steps of a given nondeterministic computation.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
