Name
Abstract | ||
|---|---|---|
We present a general computation model inspired in the notion of information hiding in software engineering. This model has the form of a game which we call quiz game. It allows in a uniform way to prove exponential lower bounds for several complexity problems. |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1016/j.jco.2015.11.005 | Journal of Complexity |
Keywords | Field | DocType |
Quiz game,Lower complexity bound,Interpolation problem,Elimination problem,Neural network,Geometrically robust constructible map | Mathematical analysis,Information hiding,Theoretical computer science,Artificial intelligence,Artificial neural network,Sequential game,Mathematics,Game complexity,Computation | Journal |
Volume | ISSN | Citations |
34 | 0885-064X | 1 |
PageRank | References | Authors |
0.35 | 3 | 6 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| B. Bank | 1 | 98 | 7.45 |
| Joos Heintz | 2 | 691 | 95.99 |
| Guillermo Matera | 3 | 142 | 14.06 |
| Josè L. Montaña | 4 | 82 | 15.50 |
| Luis Miguel Pardo | 5 | 141 | 15.63 |
| AndréS Rojas Paredes | 6 | 6 | 0.95 |