scientific article; zbMATH DE number 4047091
From MaRDI portal
Publication:3783554
zbMATH Open0642.68062MaRDI QIDQ3783554FDOQ3783554
Authors: Ming Li, Yaacov Yesha 
Publication date: 1987
Title of this publication is not available (Why is that?)
Recommendations
- Resource bounds for parallel computation of threshold and symmetric functions
- Lower Bounds for Threshold and Symmetric Functions in Parallel Computation
- Limits on the power of parallel random access machines with weak forms of write conflict resolution
- New lower bounds for parallel computation
- Improved Upper and Lower Time Bounds for Parallel Random Access Machines without Simultaneous Writes
parallel machinesPRAMdecision problemthreshold languagecomputational complexity of symmetric functionsprobabilistic lower bounds
Cited In (8)
- The Parallel Complexity of Element Distinctness is $\Omega ( \sqrt{\log n} )$
- Tight bounds for the multiplicative complexity of symmetric functions
- Resource bounds for parallel computation of threshold and symmetric functions
- Approximate inclusion-exclusion for arbitrary symmetric functions
- Separation and lower bounds for ROM and nondeterministic models of parallel computation
- Concrete Multiplicative Complexity of Symmetric Functions
- Lower Bounds for Threshold and Symmetric Functions in Parallel Computation
- On Synchronous Parallel Computations with Independent Probabilistic Choice
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 Q3783554)
