Width-Bounded Reducibility and Binary Search over Complexity Classes

d Abstract) Eric Allender Christopher Wilson Department of Computer Science Department of Computer Rutgers University and Information Science New Brunswick, NJ 08903, USA University of Oregon Eugene, OR 97403, USA SUMMARY We introduce a notion of width-bounded reducibility. Width-bounded reducibility provides a circuit-based realization of RuzzoSimon-Tompa reducibility [RS-84], and allows us to generalize that notion of reducibility. We show that reductions of simultaneously restricted width and depth provide a characterization of binary search over complexity classes, as introduced by Wagner [Wa-89] and Buss and Hay [BH-88]. This allows us to present a circuit-based characterization of PNP[log] . Other results are presented that explore relationships among complexity classes, using width-bounded reductions as a tool. Supported in part by National Science Foundation Research Initiation Grant number CCR-8810467. Some of this research was performed while this author was a visiting profe...

• Type: Conference
• Year: 1990
• Where: COCO
• Authors: Eric Allender, Christopher B. Wilson
• Keywords: Algorithms, COCO 1990, Complexity Classes, National Science Foundation, Width-bounded Reducibility