Feasible Time-Optimal Algorithms for Boolean Functions on Exclusive-Write Parallel Random-Access Machines
From MaRDI portal
Publication:5691290
DOI10.1137/S0097539791224285zbMath0864.68037MaRDI QIDQ5691290
Mirosław Kutyłowski, Martin Dietzfelbinger, K. Ruediger Reischuk
Publication date: 9 June 1997
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (2)
Gossiping and broadcasting versus computing functions in networks. ⋮ Circuit and decision tree complexity of some number theoretic problems
This page was built for publication: Feasible Time-Optimal Algorithms for Boolean Functions on Exclusive-Write Parallel Random-Access Machines
