All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”
EN
ČeštinaEnglish

Filters

1 590 (0,076s) •

Project

Combinatorial Methods in Information Theory (GN22-14872O)

, in particular lower bounds of data structures, and related notions like lifting theorems and network coding. The main aim is to narrow the gap between the current lower bounds computational lower bou...

Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

  • 2022 - 2025
    • •
  • 4 129 tis. Kč
    • •
  • 4 069 tis. Kč
    • •
  • GA ČR
Project

Arithmetic, proof theory and complexity theory (IAA1019602)

are: lower bounds for communication complexity, relation of cryptogrphical conjectures to arithmetic, independence results for bounded arithmetic, lower bounds for propositional: complexity theory, bo...

BA - Obecná matematika

  • 1996 - 1998
    • •
  • 1 779 tis. Kč
    • •
  • 823 tis. Kč
    • •
  • AV ČR
Project

Efficient approximation algorithms and circuit complexity (GX19-27871X)

The goal of this project is to understand the role of approximation in fine-grained and parameterized complexity and create solid foundations for these areas by developing lower bound techniques capable of addressing the key unprove...

Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

  • 2019 - 2024
    • •
  • 49 235 tis. Kč
    • •
  • 49 235 tis. Kč
    • •
  • GA ČR
Project

Algorithms and Complexity within and beyond Bounded Expansion (LL2005)

The project is in the area of the structural graph theory, with focus on the applications in the design of approximation and parameterized algorithms and on obtaining the corresponding complexity lower bounds. The goal is to develop...

Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

  • 2020 - 2022
    • •
  • 7 167 tis. Kč
    • •
  • 7 167 tis. Kč
    • •
  • MŠMT
Project

Restricted computations Algorithms, models, complexity (GA14-10003S)

and closer lower and upper bounds on the complexity and performance of algorithms for restricted variants of bounded space bin packing, throughput scheduling and length-bounded flows. The results will be publishe...

IN - Informatika

  • 2014 - 2016
    • •
  • 4 300 tis. Kč
    • •
  • 4 300 tis. Kč
    • •
  • GA ČR
Project

Extended Formulation of Polytopes (GA15-11559S)

the subset of polynomial reductions that allow one to translate lower bounds for extended allow us to prove meaningful lower bounds for hard problems. During the course......

IN - Informatika

  • 2015 - 2017
    • •
  • 1 866 tis. Kč
    • •
  • 1 866 tis. Kč
    • •
  • GA ČR
Project

Enumeration in informatics and optimization (GA13-21988S)

intractability by studying complexity lower bounds. We want to relate additive determinantal complexity, where exponential lower bound (co-authored by me) was established recently......

IN - Informatika

  • 2013 - 2019
    • •
  • 2 577 tis. Kč
    • •
  • 2 577 tis. Kč
    • •
  • GA ČR
Project

Parameterized algorithms and kernelization in the context of discrete mathematics and logic (GA14-03501S)

complexity lower bounds. Metatheorems for kernelization (parameterized preprocessing upper-bounds the computational complexity of the problem. The general goal here......

IN - Informatika

  • 2014 - 2016
    • •
  • 4 458 tis. Kč
    • •
  • 4 458 tis. Kč
    • •
  • GA ČR
Project

Computational and communication complexity of Boolean functions, and derandomization (GP201/07/P276)

The project proposes to study three related areas of computational complexity: circuit and branching program lower bounds, multi-party communication complexity and derandomization. In the first area we propose to study the size of <...

IN - Informatika

  • 2007 - 2009
    • •
  • 606 tis. Kč
    • •
  • 606 tis. Kč
    • •
  • GA ČR
Project

Structural Approaches in Stability Under Diversity Constraints (8J21AT021)

The goal of the project is to understand the complexity of selected problems from computational social choice. This will be done, in particular, by designing new or improved algorithms or providing lower bounds showing that such an ...

Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

  • 2021 - 2022
    • •
  • 70 tis. Kč
    • •
  • 70 tis. Kč
    • •
  • MŠMT
  • 1 - 10 out of 1 590