A communication hierarchy of parallel computations
type: Item
instance of: scholarly article
title: A communication hierarchy of parallel computations
zbMATH Open document ID: 0902.68074
DOI: 10.1016/S0304-3975(97)00033-9
author: Viliam Geffert
published in: Theoretical Computer Science
publication date: 1998-08-13T00:00:00Z
Mathematics Subject Classification ID: 68Q10
zbMATH DE Number: 1190298
zbMATH Keywords: computational complexity
zbMATH Keywords: alternation
zbMATH Keywords: synchronized alternation
MaRDI profile type: Publication
cites work: Alternation
cites work: Nondeterministic Computations in Sublogarithmic Space and Space Constructibility
cites work: Bridging across the log(n) space frontier
cites work: Q3359749
cites work: Q5592246
cites work: ON THE POWER OF ONE-WAY SYNCHRONIZED ALTERNATING MACHINES WITH SMALL SPACE
cites work: On the power of synchronization in parallel computations
cites work: Deterministic versus nondeterministic space in terms of synchronized alternating machines
cites work: Q4266537
cites work: Nondeterministic Space is Closed under Complementation
cites work: ${\text{ASPACE}}(o(\log \log n))$ is Regular
cites work: Alternating multihead finite automata
cites work: Relationships between nondeterministic and deterministic tape complexities
cites work: Counting is easy
cites work: Communication for alternating machines
cites work: Some properties of space-bounded synchronized alternating Turing machines with universal states only
cites work: ON THE POWER OF ONE-WAY GLOBALLY DETERMINISTIC SYNCHRONIZED ALTERNATING TURING MACHINES AND MULTIHEAD AUTOMATA
cites work: The method of forced enumeration for nondeterministic automata
cites work: Turing machines with sublogarithmic space
cites work: Q3922173
cites work: Q3031934
description: scientific article; zbMATH DE number 1190298