grant
Collaborative Research: AF:Medium: Structure and Quasi-Polynomial Time Algorithms
Organization University of California-Santa BarbaraLocation SANTA BARBARA, United StatesPosted 1 Oct 2025Deadline 30 Sept 2029
NSFUS FederalResearch GrantScience FoundationCA
Description preview
Throughout mathematics and computer science there is an over-arching connection between structural and descriptive mathematical statements and efficient algorithms. Here efficient algorithms mean polynomial time algorithms. These are algorithms whose running time scales well with the size of the input data that they are supposed to process. When…
🔒
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