scientific article; zbMATH DE number 3988712

MaRDI QIDQ3751010zbMATH OpenFDO

Authors Ian Parberry, Georg Schnitger

Publication date 1986

zbMATH Keywords

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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Theory of operating systems (68N25)

Recommendations

• Parallel computation with threshold functions
• Lower Bounds for Threshold and Symmetric Functions in Parallel Computation
• Threshold circuits of bounded depth
• Resource bounds for parallel computation of threshold and symmetric functions
• scientific article; zbMATH DE number 4068238

Cited in

(12)

• On the time required to sum n semigroup elements on a parallel machine with simultaneous writes
• Higher-Order Threshold Implementations
• The complexity of the parity function in unbounded fan-in, unbounded depth circuits
• scientific article; zbMATH DE number 4068238 (Why is no real title available?)
• On the relative complexity of some languages in \(NC^ 1\)
• Computing functions with parallel queries to NP
• Parallel computation with threshold functions
• Bounded-width polynomial-size branching programs recognize exactly those languages in \(NC^ 1\)
• scientific article; zbMATH DE number 4064000 (Why is no real title available?)
• Resource bounds for parallel computation of threshold and symmetric functions
• Lower Bounds for Threshold and Symmetric Functions in Parallel Computation
• Threshold circuits of bounded depth

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3751010)