Pseudorandomness for Approximate Counting and SamplingReportar como inadecuado




Pseudorandomness for Approximate Counting and Sampling - Descarga este documento en PDF. Documentación en PDF para descargar gratis. Disponible también para leer online.

computational complexity

, Volume 15, Issue 4, pp 298–341

1.Department of Computer ScienceUniversity of HaifaHaifaIsrael2.Department of Computer ScienceCalifornia Institute of TechnologyPasadenaUSA

Cite this article as: Shaltiel, R. & Umans, C. comput. complex. 2006 15: 298. https:-doi.org-10.1007-s00037-007-0218-9 DOI https:-doi.org-10.1007-s00037-007-0218-9 Publisher Name Birkhäuser-Verlag Print ISSN 1016-3328 Online ISSN 1420-8954 About this journal Personalised recommendations

Export citation .RIS Papers Reference Manager RefWorks Zotero .ENW EndNote .BIB BibTeX JabRef Mendeley Share article Email Facebook Twitter LinkedIn Shareable link Download PDF Actions

Download PDF Export citation .RIS Papers Reference Manager RefWorks Zotero .ENW EndNote .BIB BibTeX JabRef Mendeley Share article Email Facebook Twitter LinkedIn Shareable link Cookies

We use cookies to improve your experience with our site. More information Accept Over 10 million scientific documents at your fingertips

Switch Edition Academic Edition Corporate Edition Home Impressum Legal Information Accessibility Contact Us Springer Nature © 2017 Springer International Publishing AG. Part of Springer Nature.

Not logged in Not affiliated 181.57.250.105





Autor: Ronen Shaltiel1

Fuente: https://link.springer.com/







Documentos relacionados