P-Genericity and Strong G-Genericity
暂无分享,去创建一个
[1] Wolfgang Maass. Recursively Enumerable Generic Sets , 1982, J. Symb. Log..
[2] Klaus Ambos-Spies. P-Generic Sets , 1984, ICALP.
[3] Egon Börger,et al. Logic and Machines: Decision Problems and Complexity , 1984, Lecture Notes in Computer Science.
[4] Kurt Mehlhorn. On the Size of Sets of Computable Functions , 1973, SWAT.
[5] Robin Milner,et al. On Observing Nondeterminism and Concurrency , 1980, ICALP.
[6] Klaus Ambos-Spies. P-mitotic sets , 1983, Logic and Machines.
[7] Klaus Ambos-Spies,et al. Diagonalizations over Polynomial Time Computable Sets , 1987, Theor. Comput. Sci..
[8] John Gill,et al. Relative to a Random Oracle A, PA != NPA != co-NPA with Probability 1 , 1981, SIAM J. Comput..
[9] Kurt Mehlhorn. The "Almost All" Theory of Subrecursive Degrees is Decidable , 1974, ICALP.
[10] Wolfgang Maass,et al. Oracle-Dependent Properties of the Lattice of NP Sets , 1983, Theor. Comput. Sci..