Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Rudimentary reductions revisited Eric Allender
 

Summary: Rudimentary reductions revisited
Eric Allender
Department of Computer Science
Rutgers University
New Brunswick, NJ 08903
Vivek Gorey
Department of Computer Science
Rutgers University
New Brunswick, NJ 08903
April 23, 1997
Abstract: We show that log-bounded rudimentary reductions de ned and studied by Jones in
1975 characterize Dlogtime-uniform AC0
.
1 Introduction
In the rst part of the oft-cited paper Jon75 , Jones introduced logspace reductions as a tool for study-
ing the relative complexity of problems in P. In the second part of Jon75 , Jones introduced a re-
stricted version of logspace reducibility, called log-bounded rudimentary reductions. The motivation
for introducing this restriction came from 1 the desire to have a tool for talking about the structure
of very small complexity classes such as DSPACElogn, and 2 interest in generalizing the notion
of rudimentary relations," which at that time was the object of a considerable amount of attention

  

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

 

Collections: Computer Technologies and Information Sciences