The Satisfiability Problem for Probabilistic Ordered Branching Programs

Authors:
M. Agrawal;T. Thierauf
Affiliations:
-;-
Venue:
COCO '98 Proceedings of the Thirteenth Annual IEEE Conference on Computational Complexity
Year:
1998

Citing 0
Cited 2

The computational complexity of equivalence and isomorphism problems

The computational complexity of equivalence and isomorphism problems
On the size of randomized OBDDs and read-once branching programs for k-stable functions

STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science

Quantified Score

Hi-index	0.00

Visualization

Abstract