Randomness vs Time: Derandomization under a Uniform Assumption

ISSN： 0022-0000

Source： Journal of Computer and System Sciences, Vol.63, Iss.4, 2001-12, pp. : 672-688

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Worst-case hardness suffices for derandomization: a new method for hardness-randomness trade-offs

By Andreev A.E. Clementi A.E.F. Rolim J.D.P.

Theoretical Computer Science, Vol. 221, Iss. 1, 1999-06 ,pp. : 3-18

Elsevier

Access to resources Recommend Favorite

Assumption/guarantee specifications in linear-time temporal logic

By Jonsson B. Yih-Kuen T.

Theoretical Computer Science, Vol. 167, Iss. 1, 1996-10 ,pp. : 47-72

Elsevier

Access to resources Recommend Favorite

Mathematical Programming for Modelling Green Supply Chains Under Randomness and Fuzziness

International Journal of Fuzzy System Applications (IJFSA), Vol. 6, Iss. 1, 2017-01 ,pp. : 56-85

IGI Global_journal

Access to resources Recommend Favorite

Mathematical metaphysics of randomness

By Muchnik A.A. Semenov A.L. Uspensky V.A.

Theoretical Computer Science, Vol. 207, Iss. 2, 1998-11 ,pp. : 263-317

Elsevier

Access to resources Recommend Favorite

Randomness is Linear in Space

By Nisan N. Zuckerman D.

Journal of Computer and System Sciences, Vol. 52, Iss. 1, 1996-02 ,pp. : 43-52

Academic Press

Access to resources Recommend Favorite