scientific article

zbMath0607.68033MaRDI QIDQ3746885

Ian Parberry

Publication date: 1986

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

parallel machinespolynomial speedup

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45)

Related Items

What is the Church-Turing Thesis?, On the time required to sum n semigroup elements on a parallel machine with simultaneous writes, Parallel computation with threshold functions, Programmable and parallel water computing