Chapter

Automata, Languages and Programming

Volume 172 of the series Lecture Notes in Computer Science pp 58-68

Date:

P-generic sets

  • Klaus Ambos-SpiesAffiliated withLehrstuhl Informatik II, Universität Dortmund
  • , Hans FleischhackAffiliated withLehrstuhl Informatik II, Universität Dortmund
  • , Hagen HuwigAffiliated withLehrstuhl Informatik II, Universität Dortmund

* Final gross prices may vary according to local VAT.

Get Access

Abstract

We introduce the notion of a p-generic set. P-generic sets automatically have all properties which can be enforced by usual diagonalizations over polynomial time computable sets and functions. We prove that there are recursive — in fact exponential time computable — p-generic sets. The existence of p-generic sets in NP is shown to be oracle dependent, even under the assumption that PNP.