Randomness and Nondeterminism are Incomparable for Read-Once Branching Programs

Martin Sauerhoff

Published in: Electron. Colloquium Comput. Complex. (1998)

Keyphrases

situation calculus
max sat
read once formulas
vc dimension
pruning algorithms
totally ordered
machine learning
decision trees
planning domains
reduced error pruning