Testing shift-equivalence of polynomials by deterministic, probabilistic and quantum machines

Publisher： Elsevier

ISSN： 0304-3975

Source： Theoretical Computer Science, Vol.180, Iss.1, 1997-06, pp. : 217-228

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

A Testing Equivalence for Reactive Probabilistic Processes

By Kwiatkowska M.Z. Norman G.J.

Electronic Notes in Theoretical Computer Science, Vol. 16, Iss. 2, 2004-01 ,pp. : 1-19

Elsevier

Access to resources Recommend Favorite

Small deterministic Turing machines

By Kudlek M.

Theoretical Computer Science, Vol. 168, Iss. 2, 1996-11 ,pp. : 241-255

Elsevier

Access to resources Recommend Favorite

Probabilistic rebound Turing machines

By Zhang L. Inoue K. Ito A. Wang Y.

Theoretical Computer Science, Vol. 270, Iss. 1, 2002-01 ,pp. : 739-760

Elsevier

Access to resources Recommend Favorite

Decidability of equivalence for deterministic synchronized tree automata

By Salomaa K.

Theoretical Computer Science, Vol. 167, Iss. 1, 1996-10 ,pp. : 171-192

Elsevier

Access to resources Recommend Favorite

Deterministic equivalents for the problems of stochastic programming with probabilistic criteria

By Vishnaykov V. Kibzun A.

Automation and Remote Control, Vol. 67, Iss. 6, 2006-06 ,pp. : 945-961

MAIK Nauka/Interperiodica

Access to resources Recommend Favorite