Skip to Main Content
Foundations of Deductive Databases and Logic Programming
book

Foundations of Deductive Databases and Logic Programming

by Jack Minker
May 2014
Intermediate to advanced content levelIntermediate to advanced
752 pages
35h 3m
English
Morgan Kaufmann
Content preview from Foundations of Deductive Databases and Logic Programming
554 Kanellakis
sors is a potentially useful algorithm for the entire range of 1 up to m proces-
sors.
Randomization
can also play an important role, combined either with NC
or with optimal parallel algorithms. Randomized algorithms are like PRAM al-
gorithms, where each processor can at any step flip an unbiased coin and the
coin flips of different processors are independent. Without any assumptions on
the distribution of their inputs, randomized algorithms compute the correct
answer with overwhelming probability, e.g., Karp et al. [1985], Rabin [1980],
Schwartz [1980]. For example, the algorithm in Karp et al. [1985] is a ran-
domized poly logarithmi ...
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
and much more.
Start your free trial

You might also like

Concepts and Semantics of Programming Languages 1

Concepts and Semantics of Programming Languages 1

Therese Hardin, Mathieu Jaume, Francois Pessaux, Veronique Viguie Donzeau-Gouge
Handbook of Constraint Programming

Handbook of Constraint Programming

Francesca Rossi, Peter van Beek, Toby Walsh

Publisher Resources

ISBN: 9781483221120