Relationships among PL, #L, and the determinant

Eric Allender, Mitsunori Ogihara

Research output: Chapter in Book/Report/Conference proceedingConference contribution

12 Citations (Scopus)

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 languageEnglish (US)
Title of host publicationProceedings of the IEEE Annual Structure in Complexity Theory Conference
Editors Anon
PublisherPubl by IEEE
Pages267-278
Number of pages12
ISBN (Print)0818656727
StatePublished - 1994
Externally publishedYes
EventProceedings of the 9th Annual Structure in Complexity Theory Conference - Amsterdam, Neth
Duration: Jun 28 1994Jul 1 1994

Other

OtherProceedings of the 9th Annual Structure in Complexity Theory Conference
CityAmsterdam, Neth
Period6/28/947/1/94

Fingerprint

Polynomials

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Allender, E., & Ogihara, M. (1994). Relationships among PL, #L, and the determinant. In Anon (Ed.), Proceedings of the IEEE Annual Structure in Complexity Theory Conference (pp. 267-278). Publ by IEEE.

Relationships among PL, #L, and the determinant. / Allender, Eric; Ogihara, Mitsunori.

Proceedings of the IEEE Annual Structure in Complexity Theory Conference. ed. / Anon. Publ by IEEE, 1994. p. 267-278.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Allender, E & Ogihara, M 1994, Relationships among PL, #L, and the determinant. in Anon (ed.), Proceedings of the IEEE Annual Structure in Complexity Theory Conference. Publ by IEEE, pp. 267-278, Proceedings of the 9th Annual Structure in Complexity Theory Conference, Amsterdam, Neth, 6/28/94.
Allender E, Ogihara M. Relationships among PL, #L, and the determinant. In Anon, editor, Proceedings of the IEEE Annual Structure in Complexity Theory Conference. Publ by IEEE. 1994. p. 267-278
Allender, Eric ; Ogihara, Mitsunori. / Relationships among PL, #L, and the determinant. Proceedings of the IEEE Annual Structure in Complexity Theory Conference. editor / Anon. Publ by IEEE, 1994. pp. 267-278
@inproceedings{decac4e28c594ac5b806f37935f45def,
title = "Relationships among PL, #L, and the determinant",
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.",
author = "Eric Allender and Mitsunori Ogihara",
year = "1994",
language = "English (US)",
isbn = "0818656727",
pages = "267--278",
editor = "Anon",
booktitle = "Proceedings of the IEEE Annual Structure in Complexity Theory Conference",
publisher = "Publ by IEEE",

}

TY - GEN

T1 - Relationships among PL, #L, and the determinant

AU - Allender, Eric

AU - Ogihara, Mitsunori

PY - 1994

Y1 - 1994

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0028599687&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0028599687&partnerID=8YFLogxK

M3 - Conference contribution

SN - 0818656727

SP - 267

EP - 278

BT - Proceedings of the IEEE Annual Structure in Complexity Theory Conference

A2 - Anon, null

PB - Publ by IEEE

ER -