Opendata, web and dolomites

CoCoSym SIGNED

Symmetry in Computational Complexity

Total Cost €

0

EC-Contrib. €

0

Partnership

0

Views

0

Project "CoCoSym" data sheet

The following table provides information about the project.

Coordinator
UNIVERZITA KARLOVA 

Organization address
address: OVOCNY TRH 560/5
city: PRAHA 1
postcode: 116 36
website: www.cuni.cz

contact info
title: n.a.
name: n.a.
surname: n.a.
function: n.a.
email: n.a.
telephone: n.a.
fax: n.a.

 Coordinator Country Czech Republic [CZ]
 Total cost 1˙211˙375 €
 EC max contribution 1˙211˙375 € (100%)
 Programme 1. H2020-EU.1.1. (EXCELLENT SCIENCE - European Research Council (ERC))
 Code Call ERC-2017-COG
 Funding Scheme ERC-COG
 Starting year 2018
 Duration (year-month-day) from 2018-02-01   to  2023-01-31

 Partnership

Take a look of project's partnership.

# participants  country  role  EC contrib. [€] 
1    UNIVERZITA KARLOVA CZ (PRAHA 1) coordinator 1˙211˙375.00

Map

 Project objective

The last 20 years of rapid development in the computational-theoretic aspects of the fixed-language Constraint Satisfaction Problems (CSPs) has been fueled by a connection between the complexity and a certain concept capturing symmetry of computational problems in this class.

My vision is that this connection will eventually evolve into the organizing principle of computational complexity and will lead to solutions of fundamental problems such as the Unique Games Conjecture or even the P-versus-NP problem. In order to break through the current limits of this algebraic approach, I will concentrate on specific goals designed to

(A) discover suitable objects capturing symmetry that reflect the complexity in problem classes, where such an object is not known yet;

(B) make the natural ordering of symmetries coarser so that it reflects the complexity more faithfully;

(C) delineate the borderline between computationally hard and easy problems;

(D) strengthen characterizations of existing borderlines to increase their usefulness as tools for proving hardness and designing efficient algorithm; and

(E) design efficient algorithms based on direct and indirect uses of symmetries.

The specific goals concern the fixed-language CSP over finite relational structures and its generalizations to infinite domains (iCSP) and weighted relations (vCSP), in which the algebraic theory is highly developed and the limitations are clearly visible.

The approach is based on joining the forces of the universal algebraic methods in finite domains, model-theoretical and topological methods in the iCSP, and analytical and probabilistic methods in the vCSP. The starting point is to generalize and improve the Absorption Theory from finite domains.

Are you the coordinator (or a participant) of this project? Plaese send me more information about the "COCOSYM" project.

For instance: the website url (it has not provided by EU-opendata yet), the logo, a more detailed description of the project (in plain text as a rtf file or a word file), some pictures (as picture files, not embedded into any word file), twitter account, linkedin page, etc.

Send me an  email (fabio@fabiodisconzi.com) and I put them in your project's page as son as possible.

Thanks. And then put a link of this page into your project's website.

The information about "COCOSYM" are provided by the European Opendata Portal: CORDIS opendata.

More projects from the same programme (H2020-EU.1.1.)

PROGRESS (2019)

The Enemy of the Good: Towards a Theory of Moral Progress

Read More  

DISINTEGRATION (2019)

The Mass Politics of Disintegration

Read More  

HOLI (2019)

Deep Learning for Holistic Inference

Read More