Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Width-Bounded Reducibility and Binary Search over Complexity Classes
 

Summary: Width-Bounded Reducibility
and Binary Search over Complexity Classes
(Extended 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 re-
ducibility. Width-bounded reducibility pro-
vides a circuit-based realization of Ruzzo-
Simon-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 char-
acterization of binary search over complex-
ity classes, as introduced by Wagner [Wa-89]
and Buss and Hay [BH-88]. This allows us

  

Source: Allender, Eric - Department of Computer Science, Rutgers University

 

Collections: Computer Technologies and Information Sciences