A characterization of alternating log time by ramified recurrence

Publisher： Elsevier

ISSN： 0304-3975

Source： Theoretical Computer Science, Vol.236, Iss.1, 2000-04, pp. : 193-208

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

Characterization of real time iterative array by alternating device

By Terrier V.

Theoretical Computer Science, Vol. 290, Iss. 3, 2003-01 ,pp. : 2075-2084

Elsevier

Access to resources Recommend Favorite

Gap-languages and log-time complexity classes

By Regan K.W. Vollmer H.

Theoretical Computer Science, Vol. 188, Iss. 1, 1997-11 ,pp. : 101-116

Elsevier

Access to resources Recommend Favorite

O(log log N) Time Algorithms for Hamiltonian Suffix and Min-Max-Pair Heap Operations on the Hypercube

By Das S.K. Pinotti M.C.

Journal of Parallel and Distributed Computing, Vol. 48, Iss. 2, 1998-02 ,pp. : 200-211

Academic Press

Access to resources Recommend Favorite

Fully Symbolic Unbounded Model Checking for Alternating-time Temporal Logic 1

By Kacprzak Magdalena

Autonomous Agents and Multi-Agent Systems, Vol. 11, Iss. 1, 2005-07 ,pp. : 69-89

Springer Publishing Company

Access to resources Recommend Favorite

Leader election in d-dimensional CA in time diam log(diam)

By Stratmann M. Worsch T.

Future Generation Computer Systems, Vol. 18, Iss. 7, 2002-08 ,pp. : 939-950

Elsevier

Access to resources Recommend Favorite