grant
Collaborative Research: SHF: Medium: A hardware accelerator for satisfiability (SAT): Over 100x speedup for combinatorial optimization problems
Organization University of California-BerkeleyLocation BERKELEY, United StatesPosted 1 Oct 2025Deadline 30 Sept 2029
NSFUS FederalResearch GrantScience FoundationCA
Description preview
Boolean satisfiability (SAT) is a core problem in computing with broad, high-impact applications. A wide range of critical problems in industry and defense, e.g., in hardware and software design and verification, artificial intelligence, robotics, and drug discovery, use SAT solvers and often take weeks to complete on modern large-scale computing…
🔒
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