grant
AF: Small: Graph Cut Complexity, Weak Unique Games, and Adam Nonconvergence
Organization University of Southern CaliforniaLocation LOS ANGELES, United StatesPosted 1 Mar 2025Deadline 29 Feb 2028
NSFUS FederalResearch GrantScience FoundationCA
Description preview
This project attempts to find the barrier between tractability and intractability for computational problems of broad interest and central importance. That is, the investigator will try to prove that certain problems cannot be quickly solved by computers. The project will also investigate if certain known algorithms are the best possible ones for…
🔒
Start 7-day free trial — $29.99/mo →Full details available on the Agency plan
Unlock the complete grant description, eligibility criteria, contract value, evaluation details and apply link — plus alerts, pipeline tracking, and CSV export.
Agency Plan
7-day free trialUnlock procurement & grants
Upgrade to access active tenders from World Bank, UNDP, ADB and more — with email alerts and pipeline tracking.
$29.99 / month
- 🔔Email alerts for new matching tenders
- 🗂️Track tenders in your pipeline
- 💰Filter by contract value
- 📥Export results to CSV
- 📌Save searches with one click