Immediate Impact
1 by Nobel laureates 4 from Science/Nature 66 standout
Citing Papers
Discovering faster matrix multiplication algorithms with reinforcement learning
2022 StandoutNatureNobel
Training Variational Quantum Algorithms Is NP-Hard
2021 Standout
Works of Raymond E. Miller being referenced
Complexity of Computer Computations
1974
Author Peers
| Author | Last Decade | Papers | Cites | |||
|---|---|---|---|---|---|---|
| Raymond E. Miller | 611 | 354 | 324 | 82 | 1.5k | |
| Yu Jiang | 298 | 217 | 103 | 109 | 1.5k | |
| Corrado Priami | 438 | 132 | 51 | 181 | 2.2k | |
| Sheng‐De Wang | 95 | 206 | 62 | 80 | 1.6k | |
| Alan Tucker | 672 | 233 | 49 | 35 | 1.3k | |
| Xiaolin Li | 107 | 411 | 46 | 76 | 2.2k | |
| Arlindo L. Oliveira | 235 | 39 | 109 | 68 | 2.2k | |
| C. Hartmann | 156 | 261 | 56 | 73 | 1.2k | |
| Guowu Yang | 253 | 157 | 48 | 140 | 1.4k | |
| Oliver Krämer | 307 | 129 | 33 | 57 | 1.9k | |
| James Cheney | 195 | 563 | 127 | 90 | 1.7k |
All Works
Loading papers...