Randomization and Nondeterminism Are Comparable for Ordered Read-Once Branching Programs.

Farid M. Ablayev

Published in: ICALP (1997)

Keyphrases

privacy preserving
max sat
situation calculus
constraint satisfaction
partially ordered
significantly lower
ordered sets