Name
Title | ||
|---|---|---|
Satisfiability Allows No Nontrivial Sparsification Unless The Polynomial-Time Hierarchy Collapses. |
Year | Venue | DocType |
|---|---|---|
2010 | Electronic Colloquium on Computational Complexity (ECCC) | Journal |
Volume | Citations | PageRank |
17 | 0 | 0.34 |
References | Authors | |
0 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Dieter van Melkebeek | 1 | 487 | 32.80 |
| Holger Dell | 2 | 220 | 16.74 |