Name
Title | ||
|---|---|---|
Deterministically Counting Satisfying Assignments for Constant-Depth Circuits with Parity Gates, with Implications for Lower Bounds. |
Year | Venue | Field |
|---|---|---|
2018 | MFCS | Discrete mathematics,Computer science,Parity (mathematics),Electronic circuit |
DocType | Citations | PageRank |
Conference | 0 | 0.34 |
References | Authors | |
0 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ninad Rajgopal | 1 | 5 | 3.79 |
| Rahul Santhanam | 2 | 395 | 38.31 |
| Srikanth Srinivasan | 3 | 132 | 21.31 |