Sciweavers

MFCS
2005
Springer
13 years 9 months ago
Combining Self-reducibility and Partial Information Algorithms
A partial information algorithm for a language A computes, for some fixed m, for input words x1, . . . , xm a set of bitstrings containing χA(x1, . . . , xm). E.g., p-selective, ...
André Hernich, Arfst Nickelsen