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 explores the complexity of computational problems by investigating two-way finite automata and their relationship to traditional computational models. It aims to establish a new field at the intersection of computational complexity and automata theory, addressing fundamental questions about algorithmic eff…
Computational Complexity classifies computational problems according to difficulty.
Although a rich map of time complexity classes has already been developed (P, EXP, EEXP, ...;
NP, Delta2P, Sigma2P, Pi2P, ..., PH, AP;
ZPP, RP, BPP, PP;
IP;
BQP; etc.), many fundamental questions about them remain wide open.
The most famous one is P vs NP.
In 1978, Sakoda and Sipser proposed a "miniature version" of P vs NP, whose answer could yield insight into P vs NP itself.
They asked whether nondeterminism i…
Université Paris Diderot-Paris 7
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.
