Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

46

DFG
1992
Springer

favoriteEmaildiscussreport

157views Operating System» more DFG 1992»

Complexity of Boolean Functions on PRAMs - Lower Bound Techniques

14 years 3 months ago

Complexity of Boolean Functions on PRAMs - Lower Bound Techniques

Download kutylowski.im.pwr.wroc.pl

Determining time necessary for computing important functions on parallel machines is one of the most important problems in complexity theory for parallel algorithms. Recently, a substantial progress has been made in this area. In this survey paper, we discuss the results that have been obtained for three types of parallel random access machines (PRAMs): CREW, ROBUST and EREW.

Miroslaw Kutylowski

Real-time Traffic

DFG 1992 | Operating System | Parallel Algorithms | Parallel Machines | Parallel Random Access |

claim paper

Related Content

» New upper bounds on the Boolean circuit complexity of symmetric functions

» Complexity measures and decision tree complexity a survey

» Bounds for the computational power and learning complexity of analog neural nets

» Complexity Bounds for the Verification of RealTime Software

» Nonlinearity Bounds and Constructions of Resilient Boolean Functions

» Key Management for Secure Internet Multicast Using Boolean Function Minimization Technique...

» FailureSensitive Analysis of Parallel Algorithms with Controlled Memory Access Concurrency

» New bounds on classical and quantum oneway communication complexity

» Robust Polynomials and Quantum Algorithms

» Dual weak pigeonhole principle Boolean complexity and derandomization

Post Info
More Details (n/a)

Added	10 Aug 2010
Updated	10 Aug 2010
Type	Conference
Year	1992
Where	DFG
Authors	Miroslaw Kutylowski

Comments (0)