Name
Abstract | ||
|---|---|---|
How many operations are needed to compute a given polynomial f(x1; x2; : : : ; xn)? Answering questions of this form naturally leads us on a search for clever algorithmic techniques to reduce the number of operations required. Simultaneously, it also leads us towards the complementary task of finding techniques and paradigms for proving lower bounds on the minimum number of operations required. In this survey we describe one such paradigm for obtaining lower bounds.
|
Year | Venue | Field |
|---|---|---|
2018 | SIGACT News | Computer science,Arithmetic |
DocType | Volume | Issue |
Journal | 49 | 1 |
Citations | PageRank | References |
0 | 0.34 | 6 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Neeraj Kayal | 1 | 263 | 19.39 |
| Chandan Saha | 2 | 227 | 16.91 |