A simpler counterexample to a long-standing conjecture on the complexity of Bryant's apply algorithm (Q2445400)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A simpler counterexample to a long-standing conjecture on the complexity of Bryant's apply algorithm |
scientific article |
Statements
A simpler counterexample to a long-standing conjecture on the complexity of Bryant's apply algorithm (English)
0 references
14 April 2014
0 references
analysis of algorithms
0 references
computational complexity
0 references
ordered binary decision diagrams
0 references
