Pages that link to "Item:Q2011643"
From MaRDI portal
The following pages link to A deterministic algorithm for testing the equivalence of read-once branching programs with small discrepancy (Q2011643):
Displaying 4 items.
- A characterization and nearly linear-time equivalence test for \(\mu\)-branching programs (Q679436) (← links)
- A direct branching algorithm for checking the equivalence of two deterministic pushdown transducers, one of which is real-time strict (Q1124364) (← links)
- Deterministic identity testing for sum of read-once oblivious arithmetic branching programs (Q1686835) (← links)
- Identity Testing for Constant-Width, and Any-Order, Read-Once Oblivious Arithmetic Branching Programs (Q5368905) (← links)