Name
Title | ||
|---|---|---|
Equivalence of free boolean graphs can be decided probabilistically in polynomial time |
Year | DOI | Venue |
|---|---|---|
1980 | 10.1016/S0020-0190(80)90078-2 | Information Processing Letters |
Keywords | Field | DocType |
lanov schemes,Boolean functions,directed acyclic graphs,complexity,random polynomial time | Boolean network,Boolean function,Karp–Lipton theorem,Discrete mathematics,Boolean circuit,Stable polynomial,Combinatorics,Matrix polynomial,Boolean expression,2-satisfiability,Mathematics | Journal |
Volume | Issue | ISSN |
10 | 2 | 0020-0190 |
Citations | PageRank | References |
65 | 9.47 | 1 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Manuel Blum | 1 | 65 | 9.47 |
| Ashok K. Chandra | 2 | 3116 | 1215.02 |
| Mark N. Wegman | 3 | 3469 | 1358.45 |