Relationships among PL, #L, and the determinant

Eric Allender, Mitsunori Ogihara

Research output: Contribution to journalArticle

60 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)
Pages (from-to)1-21
Number of pages21
JournalTheoretical Informatics and Applications
Volume30
Issue number1
StatePublished - 1996
Externally publishedYes

Fingerprint

Determinant
Closure Properties
Reducibility
Polynomials
Counting
Polynomial time
Theorem
Relationships
Class

ASJC Scopus subject areas

  • Information Systems

Cite this

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

In: Theoretical Informatics and Applications, Vol. 30, No. 1, 1996, p. 1-21.

Research output: Contribution to journalArticle

@article{344ac4d413054a17b2c1660a64090c3e,
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 = "1996",
language = "English (US)",
volume = "30",
pages = "1--21",
journal = "RAIRO - Theoretical Informatics and Applications",
issn = "0988-3754",
publisher = "EDP Sciences",
number = "1",

}

TY - JOUR

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

AU - Allender, Eric

AU - Ogihara, Mitsunori

PY - 1996

Y1 - 1996

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=0030554482&partnerID=8YFLogxK

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

M3 - Article

AN - SCOPUS:0030554482

VL - 30

SP - 1

EP - 21

JO - RAIRO - Theoretical Informatics and Applications

JF - RAIRO - Theoretical Informatics and Applications

SN - 0988-3754

IS - 1

ER -