发文分析
近年国家/地区发文量统计
| 国家/地区 | 数量 |
|---|---|
| USA | 43 |
| Israel | 13 |
| India | 11 |
| Canada | 7 |
| England | 6 |
| Netherlands | 5 |
| CHINA MAINLAND | 3 |
| France | 3 |
| Hungary | 3 |
| Sweden | 3 |
近年机构发文量统计
| 机构 | 数量 |
|---|---|
| UNIVERSITY OF CALIFORNIA SYSTEM | 11 |
| MASSACHUSETTS INSTITUTE OF TECHNOLOGY (MIT) | 8 |
| INDIAN INSTITUTE OF TECHNOLOGY SYSTEM (IIT SYS... | 7 |
| TECHNION ISRAEL INSTITUTE OF TECHNOLOGY | 5 |
| TEL AVIV UNIVERSITY | 5 |
| CARNEGIE MELLON UNIVERSITY | 4 |
| GOOGLE INCORPORATED | 4 |
| HARVARD UNIVERSITY | 4 |
| PRINCETON UNIVERSITY | 4 |
| TOYOTA TECHNOLOGICAL INSTITUTE - CHICAGO | 4 |
近年文章引用他刊数据
| 文章名称 | 引用次数 |
|---|---|
| How to Verify a Quantum Computation | 6 |
| Quantum-Walk Speedup of Backtracking Algorithms | 4 |
| On the Hardness of Learning With Errors with Binary Secr... | 2 |
| On the Size of Homogeneous and of Depth-Four Formulas wi... | 2 |
| Randomized Polynomial-Time Identity Testing for Noncommu... | 2 |
| Succinct Hitting Sets and Barriers to Proving Lower Boun... | 2 |
| New Algorithms and Lower Bounds for Circuits With Linear... | 1 |
| Closure Results for Polynomial Factorization | 1 |
| Randomized Query Complexity of Sabotaged and Composed Fu... | 1 |
| Trading Information Complexity for Error | 1 |
近年被他刊引用数据
| 期刊名称 | 引用次数 |
|---|---|
| J ACM | 18 |
| THEOR COMPUT | 17 |
| LOG METH COMPUT SCI | 16 |
| QUANTUM-AUSTRIA | 11 |
| ALGORITHMICA | 9 |
| THEOR COMPUT SCI | 8 |
| PHYS REV A | 7 |
| J CELL AUTOM | 6 |
| J LOGIC COMPUT | 5 |
| J MACH LEARN RES | 5 |