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 aims to analyze the time complexity of algorithms related to matrix multiplication and dynamic data structures. It focuses on proving lower bounds for these problems, which are essential for understanding computational limits in algorithm design.
This project aims to establish the time complexity of algorithms for two classes of problems.
The first class consists of problems related to Boolean matrix multiplication and matrix multiplication over various semirings.
This class contains problems such as computing transitive closure of a graph and determining the minimum distance between all-pairs of nodes in a graph.
Known combinatorial algorithms for these problems run in slightly sub-cubic time.
By combinatorial algorithms we mean algorit…
UNIVERZITA KARLOVA
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 topics.
