Exact Aspects of Complexity Theory
One of 1,906 projects Taiyo tracks in Israel.
Source: EU Funding & Tenders Portal
The classical definition of efficient algorithms as those running in poly-time is long recognized as insufficient. In the era of big data, for example, a linear-time algorithm can be deemed feasible in situations where a quadratic one is not. On the other end of the spectrum, even modest improvements to the base of the exponent in an exp-time algorithm can dramatically expand the range of problem
- Status
- Prospective
- Sector
- Education, Commercial
- Location
- Israel
- Updated
- 19 Nov 2026
- Source
- EU Funding & Tenders Portal
ConstructChat
Ask ConstructChat about Exact Aspects of Complexity Theory
Pick a question to edit it, or write your own.
First answer free · no account
Project Information FAQ
Project Information
Participants
| Not available for this record. |
Status
Original status | forthcoming |
Taiyo status | Prospective |
Taiyo last update | 2026-11-19 |
Contact
| Not available for this record. |
Description
Description | The classical definition of efficient algorithms as those running in poly-time is long recognized as insufficient. In the era of big data, for example, a linear-time algorithm can be deemed feasible in situations where a quadratic one is not. On the other end of the spectrum, even modest improvements to the base of the exponent in an exp-time algorithm can dramatically expand the range of problem instances for which a solution remains viable. This research aims to refine complexity theory by developing precise characterizations of worst-case running times for fundamental problems, identifying input instances that require that worst-case complexity, and establishing bidirectional relationships between the exact hardness of poly-time problems and NP-complete ones. More specifically, our major objectives are (1) Refine upper bounds on the running times of algorithms for core NP-complete problems (such as SAT, Graph Coloring, Subset Sum) to better ground, sharpen, or test fine-grained complexity conjectures; (2) Characterize the structure of worst-case instances for central NP-complete problems, agnostically to the running time itself; (3) Establish a bidirectional equivalence between the exact hardness of certain poly-time problems and NP-complete ones, building on insights from fine-grained complexity that provide one-directional reductions. Our prior work includes significant advances in the relevant areas. We achieved the first improvements in decades for the running times of key NP-complete problems such as k-SAT and Graph Coloring. Additionally, we provided foundational conditional lower bounds for important approximation and graph algorithmic problems through fine-grained complexity theory. The fusion of expertise from exact algorithms and fine-grained complexity positions us uniquely to tackle the ambitious goals above. Achieving those may establish a theory of completely tying up exact running times of efficient problems to classical conjectures such as NP!=P. |
Location
Country | Israel |
Source
Source | EU Funding & Tenders Portal |
URL |
More Details
Record type | Project |
Sector | Education, Commercial |
Article published date | 2026-09-01 |
Research
Free account
View all details
You are reading the public part. A free account opens the rest:
- Every detail on this project
- News and media coverage
- Technical research
Free account · no card · lands you back on this project
More Education projects in Israel
- BIONDVAX UNIVERSAL FLU VACCINE (IDFF)
- Mediterranean Cooperation in the Treatment and Valorisation of Olive Mill Wastewater (OMW)
- Profitable and Sustainable artisanal olive oil industry in the Mediterranean
- Mediterranean Technology Led Incubator Co-Operation
- Cost-effective rehabilitation of public buildings into smart and resilient nano-grids using storage
- Speeding up the MED SMEs' uptaking of eco-innovative solutions in energy and water management
- Mediterranean SME working together to make cities smarter
- V house / Blatman Cohen architecture design
