scientific article; zbMATH DE number 4119627

MaRDI QIDQ4733406zbMATH OpenFDO

Authors Gianfranco Bilardi, Abha Moitra

Publication date 1989

zbMATH Keywords

lower boundsmonotone Boolean functionsparallel random access machines

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• The critical complexity of all (monotone) boolean functions and monotone graph properties
• Time Complexity of Boolean Functions on CREW PRAM<scp>s</scp>
• Exact lower time bounds for computing Boolean functions on CREW PRAMs
• Improved Upper and Lower Time Bounds for Parallel Random Access Machines without Simultaneous Writes
• New lower bounds for parallel computation

Cited in

(3)

• Exact lower time bounds for computing Boolean functions on CREW PRAMs
• Time Complexity of Boolean Functions on CREW PRAM<scp>s</scp>
• The critical complexity of all (monotone) boolean functions and monotone graph properties

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 Q4733406)