Equivalence of free Boolean graphs can be decided probabilistically in polynomial time (Q1144943)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Equivalence of free Boolean graphs can be decided probabilistically in polynomial time |
scientific article; zbMATH DE number 3694609
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Equivalence of free Boolean graphs can be decided probabilistically in polynomial time |
scientific article; zbMATH DE number 3694609 |
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
