Weizmann Logo
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style

Reports tagged with equivalencetest:
TR98-051 | 20th July 1998
Petr Savicky

A probabilistic nonequivalence test for syntactic (1,+k)-branching programs

Branching programs are a model for representing Boolean
functions. For general branching programs, the
satisfiability and nonequivalence tests are NP-complete.
For read-once branching programs, which can test each
variable at most once in each computation, the satisfiability
test is trivial and there is also a probabilistic polynomial
time test ... more >>>

ISSN 1433-8092 | Imprint