You are here: Home › Books › Parallel complexity of logical query programs (Report / Department of Computer Science, Stanford University)

Parallel complexity of logical query programs (Report / Department of Computer Science, Stanford University)

Parallel complexity of logical query programs (Report / Department of Computer Science, Stanford University)

Author: Jeffrey D Ullman

0.00 of 0

Click the button below to register a free account and download the file


Download PDF

Download ePub

*Disclosure:“This post may contain affiliate links and I earn from qualifying purchases”.