No label defined (Q3725549)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 3956444
Language Label Description Also known as
default for all languages
No label defined
    English
    No label defined
    scientific article; zbMATH DE number 3956444

      Statements

      0 references
      1986
      0 references
      alternation
      0 references
      sequential and parallel computations
      0 references
      tradeoffs of
      0 references
      complexity measures
      0 references
      multihead machines and automata
      0 references
      alternating machine
      0 references
      lower bounds
      0 references
      [For the entire collection see Zbl 0587.00019.] The alternating machine having a separate input tape with k two-way read- only heads, and a certain number of internal configurations - AM(k) - is considered as parallel computing model. For the TIME-SPACE-PARALLELISM (TSP) tradeoff, the optimal lower bounds \(\Omega (n^ 2)\) and \(\Omega (n^{3/2})\) resp. are proved for the recognition of specific languages on AM(1) and AM(k) respectively. For the complexity measure REVERSALS- SPACE-PARALLELISM (RSP), the lower bound \(\Omega (n^{1/3}/\log_ 2n)\) is established for the recognition of a specific language on AM(k). This result implies \(\Omega (n^ a)\), \(a>0\), lower bound on PTIME-HARDWARE of parallel RAM's. The lower bounds for the complexity measures TIME-SPACE and REVERSALS- SPACE of sequential computing models follow as direct consequences of the results obtained. Several strongest lower bounds for two-way (and one- way) alternating (nondeterministic, and deterministic) multihead finite automata follow, too. All lower bounds obtained for AM(k) are substantially improved for the case that \(SPACE\geq n^ b\), for \(0<b<1\). Using these results one can formulate several hierarchies for different computing models.
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references