Objective
The project is intended to introduce new techniques in the study of the complexity of Boolean functions and to use them for some important applications in computer science. In particular, the project will consider three general application fields:
Efficient De-randomization of Probabilistic Algorithms;
The Study of the Complexity of Feasible (Propositional) Proofs;
Communication Complexity on Distributed Computational Model. A good motivation for this project lies in the very high quality and experience that every partner has about the research fields considered by the project. This experience is widely certified by the large number of technical and general results that have been obtained over the last decade and published in the most important Conferences and Journals in Theoretical Computer Science and Discrete Mathematics. Furthermore, previous joint works between the partners give strong evidence on the complementary nature from which all members (especially young researchers) can benefit from the project. The training programme of the project will be organized around the main ideas of the joint research teams, the exchange of young post-doctoral and doctoral researchers through short (1-2 weeks) and long (1-3 months) term visits, and Workshops that will be organized by the project. The project will also cover the expenses of the participation of young and senior researchers in important international conferences.
Topic(s)
Data not availableCall for proposal
Data not availableFunding Scheme
Data not availableCoordinator
1204 Geneva
Switzerland