Improved Upper and Lower Time Bounds for Parallel Random Access Machines without Simultaneous Writes
From MaRDI portal
Publication:3204042
DOI10.1137/0220005zbMath0716.68045OpenAlexW2090901963MaRDI QIDQ3204042
Publication date: 1991
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/3474222251d14c73ef548e218483ef890ed0bfb8
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (4)
Exact lower time bounds for computing Boolean functions on CREW PRAMs ⋮ An insight on PRAM computational bounds ⋮ Interpolation of the discrete logarithm in \(\mathbb{F}_{q}\) by Boolean functions and by polynomials in several variables modulo a divisor of \(q-1\). ⋮ Circuit and decision tree complexity of some number theoretic problems
This page was built for publication: Improved Upper and Lower Time Bounds for Parallel Random Access Machines without Simultaneous Writes
