Equivalence of free Boolean graphs can be decided probabilistically in polynomial time (Q1144943): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 04:06, 31 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Equivalence of free Boolean graphs can be decided probabilistically in polynomial time |
scientific article |
Statements
Equivalence of free Boolean graphs can be decided probabilistically in polynomial time (English)
0 references
1980
0 references
equivalence of free Boolean graphs
0 references
Ianov schemes
0 references
Boolean functions
0 references
directed acyclic graphs
0 references
random polynomial time
0 references
