Non-Uniform Reductions

Authors:
Harry Buhrman;Benjamin Hescott;Steven Homer;Leen Torenvliet
Affiliations:
CWI, Kruislaan 409, 1098, Amsterdam, SJ, The Netherlands;Tufts University, Computer Science Department, 161 College Ave, 02155, Medford, MA, USA;Boston University, Computer Science Department, 111 Cummington St, 02215, Boston, MA, USA;ILLC, Plantage Muidergracht 24, Amsterdam, The Netherlands
Venue:
Theory of Computing Systems
Year:
2010

Citing 0
Cited 1

A thirty year old conjecture about promise problems

ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study properties of non-uniform reductions and related completeness notions. We strengthen several results of Hitchcock and Pavan (ICALP (1), Lecture Notes in Computer Science, vol. 4051, pp. 465–476, Springer, 2006) and give a trade-off between the amount of advice needed for a reduction and its honesty on NEXP. We construct an oracle relative to which this trade-off is optimal. We show, in a more systematic study of non-uniform reductions, among other things that non-uniformity can be removed at the cost of more queries. In line with Post’s program for complexity theory (Buhrman and Torenvliet in Bulletin of the EATCS 85, pp. 41–51, 2005) we connect such ‘uniformization’ properties to the separation of complexity classes.