On Computational Limits of Modern Hopfield Models: A Fine-Grained Complexity Analysis is a research paper published in arXiv (Cornell University) (2024). On theSindex it has a DataRank of 0.
Scored on demand from live citation data
DataRank reads this dataset's downstream impact straight off the citation graph β no black box, no proprietary weighting. How is this computed?
FAIR checklist signals are shown for context only and do not affect DataRank scoring.
We only score data papers we can read in full β never from an abstract alone.
National Science Foundation
Grant: 1841569
CAREER: An Integrated Inferential Framework for Big Data Research and Education
National Science Foundation
Grant: 1740735
Collaborative Research: TRIPODS Institute for Optimization and Learning
Fields of Study
Keywords