On Completeness under Random Reductions

ISSN： 0022-0000

Source： Journal of Computer and System Sciences, Vol.53, Iss.3, 1996-12, pp. : 545-555

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

Cryptographic limitations on parallelizing membership and equivalence queries with applications to random-self-reductions

By Fischlin

Theoretical Computer Science, Vol. 268, Iss. 2, 2001-10 ,pp. : 199-219

Elsevier

Access to resources Recommend Favorite

On denotational completeness

By Girard J.-Y.

Theoretical Computer Science, Vol. 227, Iss. 1, 1999-09 ,pp. : 249-273

Elsevier

Access to resources Recommend Favorite

Inclusion properties for random relations under the hypotheses of stochastic independence and non-interactivity

By Tonon F. Chen S.

International Journal of General Systems, Vol. 34, Iss. 5, 2005-10 ,pp. : 615-624

Taylor & Francis Ltd

Access to resources Recommend Favorite

Completeness of Park induction

By Esik Z.

Theoretical Computer Science, Vol. 177, Iss. 1, 1997-04 ,pp. : 217-283

Elsevier

Access to resources Recommend Favorite

Algebraic proofs of consistency and completeness

By Gardiner P.H.B.

Theoretical Computer Science, Vol. 150, Iss. 1, 1995-10 ,pp. : 161-191

Elsevier

Access to resources Recommend Favorite