A simpler counterexample to a long-standing conjecture on the complexity of Bryant's apply algorithm (Q2445400): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Exact OBDD bounds for some fundamental functions / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Asymptotically optimal bounds for OBDDs and the solution of some basic OBDD problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Graph-Based Algorithms for Boolean Function Manipulation / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Branching Programs and Binary Decision Diagrams / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Counterexamples to the long-standing conjecture on the complexity of BDD binary operations / rank | |||
Normal rank | |||
Latest revision as of 09:10, 8 July 2024
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
