Author:
Hernich André,Nickelsen Arfst
Publisher
Springer Berlin Heidelberg
Reference30 articles.
1. Agrawal, M., Arvind, V.: Polynomial time truth-table reductions to P-selective sets. In: Proc. 9th Structure in Complexity Theory (1994)
2. Amir, A., Beigel, R., Gasarch, W.: Some connections between bounded query classes and non-uniform complexity. In: Proc. 5th Struct. in Complexity Th. (1990)
3. Amir, A., Gasarch, W.: Polynomial terse sets. Inf. and Computation 77 (1988)
4. Lecture Notes in Computer Science;S. Bab,2004
5. Beigel, R.: Query-Limited Reducibilities. PhD thesis, Stanford University (1987)