### Abstract

Recent results by Toda, Vinay, Damm, and Valiant have shown that the complexity of the determinant is characterized by the complexity of counting the number of accepting computations of a nondeterministic logspace-bounded machine. (This class of functions is known as #L.) By using that characterization and by establishing a few elementary closure properties, we give a very simple proof of a theorem of Jung, showing that probabilistic logspace-bounded (PL) machines lose none of their computational power if they are restricted to run in polynomial time. We also present new results comparing and contrasting the classes of functions reducible to PL, #L, and the determinant, using various notions of reducibility.

Original language | English (US) |
---|---|

Title of host publication | Proceedings of the IEEE Annual Structure in Complexity Theory Conference |

Editors | Anon |

Publisher | Publ by IEEE |

Pages | 267-278 |

Number of pages | 12 |

ISBN (Print) | 0818656727 |

State | Published - Dec 1 1994 |

Externally published | Yes |

Event | Proceedings of the 9th Annual Structure in Complexity Theory Conference - Amsterdam, Neth Duration: Jun 28 1994 → Jul 1 1994 |

### Publication series

Name | Proceedings of the IEEE Annual Structure in Complexity Theory Conference |
---|---|

ISSN (Print) | 1063-6870 |

### Other

Other | Proceedings of the 9th Annual Structure in Complexity Theory Conference |
---|---|

City | Amsterdam, Neth |

Period | 6/28/94 → 7/1/94 |

### Fingerprint

### ASJC Scopus subject areas

- Engineering(all)

### Cite this

*Proceedings of the IEEE Annual Structure in Complexity Theory Conference*(pp. 267-278). (Proceedings of the IEEE Annual Structure in Complexity Theory Conference). Publ by IEEE.