scientific article
From MaRDI portal
Publication:3751010
zbMath0611.68024MaRDI QIDQ3751010
Publication date: 1986
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
parallel machineWRAMsalternating Turing machinesimulations of deterministic Turing machinesunbounded fan-in parallel computationparallel timeconstant-time shared-memory machinesresource of time and address complexityThreshold parallel computersthreshold Turing machine
Related Items (6)
Threshold circuits of bounded depth ⋮ On the time required to sum n semigroup elements on a parallel machine with simultaneous writes ⋮ Parallel computation with threshold functions ⋮ Bounded-width polynomial-size branching programs recognize exactly those languages in \(NC^ 1\) ⋮ On the relative complexity of some languages in \(NC^ 1\) ⋮ The complexity of the parity function in unbounded fan-in, unbounded depth circuits
This page was built for publication: