Vše

Co hledáte?

Vše
Projekty
Výsledky výzkumu
Subjekty

Rychlé hledání

  • Projekty podpořené TA ČR
  • Významné projekty
  • Projekty s nejvyšší státní podporou
  • Aktuálně běžící projekty

Chytré vyhledávání

  • Takto najdu konkrétní +slovo
  • Takto z výsledků -slovo zcela vynechám
  • “Takto můžu najít celou frázi”
CS
ČeštinaEnglish

Filtry

1 644 (0,07s) •

Projekt

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
Projekt

Tight Parameterized Results for Directed Connectivity Problems (GA17-20065S)

lower bounds, showing that the existence of significantly faster algorithms that of the existing algorithms, or to obtain lower bounds showing that such an improvement......

IN - Informatika

  • 2017 - 2019
    • •
  • 1 986 tis. Kč
    • •
  • 1 620 tis. Kč
    • •
  • GA ČR
Projekt

Function theory and operator theory in Bergman spaces (IAA100190802)

and operators on bounded symmetric domains; and boundary singularities of weighted Bergman kernels. All these problems have applications in mathematical physics (quantization......

BA - Obecná matematika

  • 2008 - 2011
    • •
  • 892 tis. Kč
    • •
  • 892 tis. Kč
    • •
  • AV ČR
Projekt

Function theory and operator theory in Bergman spaces (IAA1019304)

invariant function spaces and canonical classes of operators on bounded symmetric domains, Bergman kernels, their generalizations and applications, and the Berezin......

BA - Obecná matematika

  • 2003 - 2006
    • •
  • 1 213 tis. Kč
    • •
  • 544 tis. Kč
    • •
  • AV ČR
Projekt

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
Projekt

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
Projekt

Function theory and operator theory in Bergman spaces (IAA1019005)

of the Bergman reproducing kernels, study of the Berezin transform and its connections with harmonicity, and function theory and canonical classes of operators on bounded symmetric......

BA - Obecná matematika

  • 2000 - 2002
    • •
  • 764 tis. Kč
    • •
  • 351 tis. Kč
    • •
  • AV ČR
Projekt

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
Projekt

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
Projekt

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
  • 1 - 10 z 1 644