Properties of complexity measures for PRAMs and WRAMs
From MaRDI portal
DOI10.1016/0304-3975(86)90083-6zbMATH Open0626.68040OpenAlexW2064007242MaRDI QIDQ580980FDOQ580980
Siegfried Bublitz, Ute Schuerfeld, Ingo Wegener
Publication date: 1986
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(86)90083-6
Recommendations
complexity measures for Boolean functionscomplexity measures for parallel computerscomputation of Boolean functionsparallel computers with shared memoryPRAMsWRAMs
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Upper and Lower Time Bounds for Parallel Random Access Machines without Simultaneous Writes
- On recognizing graph properties from adjacency matrices
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- The critical complexity of graph properties
- Trade-Offs between Depth and Width in Parallel Computation
- The critical complexity of all (monotone) boolean functions and monotone graph properties
- Optimal decision trees and one-time-only branching programs for symmetric Boolean functions
Cited In (9)
- Composition limits and separating examples for some Boolean function complexity measures
- Gossiping and broadcasting versus computing functions in networks.
- Parallel information-based complexity
- Quantum certificate complexity
- Exact lower time bounds for computing Boolean functions on CREW PRAMs
- Title not available (Why is that?)
- The complexity of symmetric functions in bounded-depth circuits
- The nonapproximability of OBDD minimization
- Title not available (Why is that?)
This page was built for publication: Properties of complexity measures for PRAMs and WRAMs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q580980)
