Feasible Time-Optimal Algorithms for Boolean Functions on Exclusive-Write Parallel Random-Access Machines
From MaRDI portal
Recommendations
- A tight ω(loglog n)-bound on the time for parallel RAM's to compute nondegenerated boolean functions
- Exact lower time bounds for computing Boolean functions on CREW PRAMs
- Upper and Lower Time Bounds for Parallel Random Access Machines without Simultaneous Writes
- Boolean circuit programming: A new paradigm to design parallel algorithms
- scientific article; zbMATH DE number 3957104
- Improved Upper and Lower Time Bounds for Parallel Random Access Machines without Simultaneous Writes
- Complexity of sequential implementation of partial Boolean functions
- Parallel Time $O(\log n)$ Acceptance of Deterministic CFL<scp>s</scp> on an Exclusive-Write P-RAM
- Parallel algorithms for evaluation of directional Boolean derivatives of multivalued logic functions
- An O(nm)-time algorithm for computing the dual of a regular Boolean function
Cited in
(11)- Multiprocessor simulation strategies with optimal speed-up
- Gossiping and broadcasting versus computing functions in networks.
- Circuit and decision tree complexity of some number theoretic problems
- Computing with light: toward parallel Boolean algebra
- A tight ω(loglog n)-bound on the time for parallel RAM's to compute nondegenerated boolean functions
- Time Complexity of Boolean Functions on CREW PRAM<scp>s</scp>
- Using light to implement parallel Boolean algebra
- Parallel Time $O(\log n)$ Acceptance of Deterministic CFL<scp>s</scp> on an Exclusive-Write P-RAM
- CREW PRAM<scp>s</scp> and Decision Trees
- scientific article; zbMATH DE number 1559570 (Why is no real title available?)
- Separating the power of EREW and CREW PRAMs with small communication width
This page was built for publication: Feasible Time-Optimal Algorithms for Boolean Functions on Exclusive-Write Parallel Random-Access Machines
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5691290)
