CORDIS Project
Funding breakdown and partner intelligence are Premium
Sign in and upgrade to Premium for EU contribution totals, consortium analytics, OpenAlex research context, and AI summaries. · 0 consortium intelligence fields visible of 1
Start free • Cancel anytime • 14-day refund guarantee
This project investigates the complexity of computing polynomials and related problems in theoretical computer science, such as graph matchings and quantum state analysis. It aims to develop new methods to address these fundamental challenges, potentially leading to significant breakthroughs in understanding computatio…
This research proposal will address fundamental problems concerning the complexity of computingand manipulating polynomials.
For example, consider the following questions:1.
What is the complexity of computing the total weight of perfect matchings of a weighted graph?2.
Is there an efficient deterministic parallel algorithm that determines whether a graph has a perfect matching?3.
Is approximation much easier than exact computation?4.
How many EPR pairs can we distill from a given quantum state?…
TEL AVIV UNIVERSITY
Partner organizations (coordinator is shown above), with normalized type and CORDIS activity type. Guests see up to 4 partners.
Similar projects, consortium collaboration history, frequent partners, and OpenAlex research context.
Guests see up to 5 EuroSciVoc fields.
Guests see up to 5 topics.
Guests see up to 5 keywords.
