More deterministic simulation in logspace

Noam Nisan; David Zuckerman

doi:10.1145/167088.167162

More deterministic simulation in logspace

Noam Nisan, David Zuckerman

The Rachel and Selim Benin School of Engineering and Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

50 Scopus citations

Abstract

We show that any randomized space(S) algorithm which uses only poly(S) random bits can be simulated deterministically in space(S), for 5(n) > logn. Of independent interest is our main technical tool: A procedure which extracts randomness from a defective random source using a small additional number of truly random bits.

Original language	American English
Title of host publication	Proceedings of the 25th Annual ACM Symposium on Theory of Computing, STOC 1993
Publisher	Association for Computing Machinery
Pages	235-244
Number of pages	10
ISBN (Electronic)	0897915917
DOIs	https://doi.org/10.1145/167088.167162
State	Published - 1 Jun 1993
Event	25th Annual ACM Symposium on Theory of Computing, STOC 1993 - San Diego, United States Duration: 16 May 1993 → 18 May 1993

Publication series

Name	Proceedings of the Annual ACM Symposium on Theory of Computing
Volume	Part F129585
ISSN (Print)	0737-8017

Conference

Conference	25th Annual ACM Symposium on Theory of Computing, STOC 1993
Country/Territory	United States
City	San Diego
Period	16/05/93 → 18/05/93

Bibliographical note

Funding Information:
*Dept. of CS, Hebrew University, Jerusalem. Supported by BSF 89-00126 and by a Wolfson research award. Part of this research waa done while the author visited IBM Almaden. t MIT Lab for Computer Science, 545 Technology %u=e, Cambridge, MA 02139. Supported by an NSF Postdoctoral Fellowship. Part of this research was done while the author visited the Hebrew University in Jerusalem, Princeton University through DIMACS, and the International Computer Science Institute in Berkeley. Permission to copy without fee all or part of this material is granted provided that the copies are not made or distributed for direct commercial advantage, the ACM copyright notice and the title of the publication and its date appear, and notice is given that copying is by permission of the Association for Computing Machinery. To copy otherwise, or to republish, raquires a fee and/or specific permission. 25th ACM STOC ‘93-51931CA,LJSA 0 1993 ACM 0-S9791-591 -7/93 /0005 /0235 ... $1 ,50

Publisher Copyright:
© 1993 ACM.

Access to Document

10.1145/167088.167162

Cite this

@inproceedings{d0ca5701ae8445c4b063b82ac41c2105,

title = "More deterministic simulation in logspace",

abstract = "We show that any randomized space(S) algorithm which uses only poly(S) random bits can be simulated deterministically in space(S), for 5(n) > logn. Of independent interest is our main technical tool: A procedure which extracts randomness from a defective random source using a small additional number of truly random bits.",

author = "Noam Nisan and David Zuckerman",

note = "Funding Information: *Dept. of CS, Hebrew University, Jerusalem. Supported by BSF 89-00126 and by a Wolfson research award. Part of this research waa done while the author visited IBM Almaden. t MIT Lab for Computer Science, 545 Technology %u=e, Cambridge, MA 02139. Supported by an NSF Postdoctoral Fellowship. Part of this research was done while the author visited the Hebrew University in Jerusalem, Princeton University through DIMACS, and the International Computer Science Institute in Berkeley. Permission to copy without fee all or part of this material is granted provided that the copies are not made or distributed for direct commercial advantage, the ACM copyright notice and the title of the publication and its date appear, and notice is given that copying is by permission of the Association for Computing Machinery. To copy otherwise, or to republish, raquires a fee and/or specific permission. 25th ACM STOC {\textquoteleft}93-51931CA,LJSA 0 1993 ACM 0-S9791-591 -7/93 /0005 /0235 ... $1 ,50 Publisher Copyright: {\textcopyright} 1993 ACM.; 25th Annual ACM Symposium on Theory of Computing, STOC 1993 ; Conference date: 16-05-1993 Through 18-05-1993",

year = "1993",

month = jun,

day = "1",

doi = "10.1145/167088.167162",

language = "American English",

series = "Proceedings of the Annual ACM Symposium on Theory of Computing",

publisher = "Association for Computing Machinery",

pages = "235--244",

booktitle = "Proceedings of the 25th Annual ACM Symposium on Theory of Computing, STOC 1993",

}

Nisan, N & Zuckerman, D 1993, More deterministic simulation in logspace. in Proceedings of the 25th Annual ACM Symposium on Theory of Computing, STOC 1993. Proceedings of the Annual ACM Symposium on Theory of Computing, vol. Part F129585, Association for Computing Machinery, pp. 235-244, 25th Annual ACM Symposium on Theory of Computing, STOC 1993, San Diego, United States, 16/05/93. https://doi.org/10.1145/167088.167162

More deterministic simulation in logspace. / Nisan, Noam; Zuckerman, David.
Proceedings of the 25th Annual ACM Symposium on Theory of Computing, STOC 1993. Association for Computing Machinery, 1993. p. 235-244 (Proceedings of the Annual ACM Symposium on Theory of Computing; Vol. Part F129585).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - More deterministic simulation in logspace

AU - Nisan, Noam

AU - Zuckerman, David

N1 - Funding Information: *Dept. of CS, Hebrew University, Jerusalem. Supported by BSF 89-00126 and by a Wolfson research award. Part of this research waa done while the author visited IBM Almaden. t MIT Lab for Computer Science, 545 Technology %u=e, Cambridge, MA 02139. Supported by an NSF Postdoctoral Fellowship. Part of this research was done while the author visited the Hebrew University in Jerusalem, Princeton University through DIMACS, and the International Computer Science Institute in Berkeley. Permission to copy without fee all or part of this material is granted provided that the copies are not made or distributed for direct commercial advantage, the ACM copyright notice and the title of the publication and its date appear, and notice is given that copying is by permission of the Association for Computing Machinery. To copy otherwise, or to republish, raquires a fee and/or specific permission. 25th ACM STOC ‘93-51931CA,LJSA 0 1993 ACM 0-S9791-591 -7/93 /0005 /0235 ... $1 ,50 Publisher Copyright: © 1993 ACM.

PY - 1993/6/1

Y1 - 1993/6/1

N2 - We show that any randomized space(S) algorithm which uses only poly(S) random bits can be simulated deterministically in space(S), for 5(n) > logn. Of independent interest is our main technical tool: A procedure which extracts randomness from a defective random source using a small additional number of truly random bits.

AB - We show that any randomized space(S) algorithm which uses only poly(S) random bits can be simulated deterministically in space(S), for 5(n) > logn. Of independent interest is our main technical tool: A procedure which extracts randomness from a defective random source using a small additional number of truly random bits.

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

U2 - 10.1145/167088.167162

DO - 10.1145/167088.167162

M3 - Conference contribution

AN - SCOPUS:0027208504

T3 - Proceedings of the Annual ACM Symposium on Theory of Computing

SP - 235

EP - 244

BT - Proceedings of the 25th Annual ACM Symposium on Theory of Computing, STOC 1993

PB - Association for Computing Machinery

T2 - 25th Annual ACM Symposium on Theory of Computing, STOC 1993

Y2 - 16 May 1993 through 18 May 1993

ER -

More deterministic simulation in logspace

Abstract

Publication series

Conference

Bibliographical note

Access to Document

Other files and links

Cite this