Equivalence of free Boolean graphs can be decided probabilistically in polynomial time (Q1144943): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Binary Decision Diagrams / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4160379 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5517672 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On Ianov's Program Schemata / rank | |||
Normal rank | |||
Revision as of 09:28, 13 June 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
