Normal numbers and sources for BPP

Publisher： Elsevier

ISSN： 0304-3975

Source： Theoretical Computer Science, Vol.178, Iss.1, 1997-05, pp. : 155-169

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

Weak bisimilarity between finite-state systems and BPA or normed BPP is decidable in polynomial time

By Kucera

Theoretical Computer Science, Vol. 270, Iss. 1, 2002-01 ,pp. : 677-700

Elsevier

Access to resources Recommend Favorite

On BPP versus NP&unknown;coNP for ordered read-once branching programs

By Ablayev

Theoretical Computer Science, Vol. 264, Iss. 1, 2001-08 ,pp. : 127-137

Elsevier

Access to resources Recommend Favorite

On tables of random numbers

By Kolmogorov A.N.

Theoretical Computer Science, Vol. 207, Iss. 2, 1998-11 ,pp. : 387-395

Elsevier

Access to resources Recommend Favorite

Forcing numbers of stop signs

By Lam F. Pachter L.

Theoretical Computer Science, Vol. 303, Iss. 2, 2003-07 ,pp. : 409-416

Elsevier

Access to resources Recommend Favorite

The Kolmogorov complexity of real numbers

By Staiger L.

Theoretical Computer Science, Vol. 284, Iss. 2, 2002-07 ,pp. : 455-466

Elsevier

Access to resources Recommend Favorite