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

433 (0,164s) •

Project

*Stabilizers chemically bound to polymers (FR-TI2/338)

*Novel polymer-bound antidegradants, bearing sterically hindered phenolic and amine structures, will be prepared, characterized and applied. The polymeric substrates will be, e.g., liquid polybutadienes or polyurethanes. The main outputs wil...

CD - Makromolekulární chemie

  • 2010 - 2013
    • •
  • 19 421 tis. Kč
    • •
  • 14 431 tis. Kč
    • •
  • MPO
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 the deta...

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

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 and upper bounds of dynamic data structure or...

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)

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

BA - Obecná matematika

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

Fundamental bounds on electromagnetic radiation and scattering phenomena and associated realizable subforms (GA19-06049S)

an understanding of the physical bounds on the primary physical quantities as well as system-objective bounds. This project strives to fill a gap in the knowledge of classical the bounds are reachable with realistic design...

Applied mathematics

  • 2019 - 2021
    • •
  • 5 745 tis. Kč
    • •
  • 5 745 tis. Kč
    • •
  • GA ČR
Project

Bound states of positrons and molecules studied by the means of positron beams. (ME 556)

Positron-molecule system and transport of positrons through matter will be studied by means of scattering theory with emphasis on theory of resonances. Bound calculations will be complemented with scattering ones and with extended experiment...

BG - Jaderná, atomová a molekulová fyzika, urychlovače

  • 2002 - 2004
    • •
  • 2 589 tis. Kč
    • •
  • 948 tis. Kč
    • •
  • MŠMT
Project

Complexity of mathematical proofs and structures (GA19-05497S)

of settings, including bounded arithmetic, model theory, algebraic complexity, bounded set...

Pure mathematics

  • 2019 - 2022
    • •
  • 9 171 tis. Kč
    • •
  • 8 514 tis. Kč
    • •
  • GA ČR
Project

Bound electronic states due to defects in III - V semiconductors (GA202/96/0021)

The proposal project aims at the systematic study of bound electronic states induced by impurities, defects, surfaces and edges. Individual and collective electronic properties of these localized states in 3D and 2D systems will be investiga...

BM - Fyzika pevných látek a magnetismus

  • 1996 - 1998
    • •
  • 1 818 tis. Kč
    • •
  • 972 tis. Kč
    • •
  • GA ČR
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 published in high...

IN - Informatika

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

Circuit Complexity and Self-Reducibility (GAP202/10/0854)

The project proposes to study two areas of computational complexity: circuits of bounded depth and self-reducibility of functions. In the area of circuits of bounded depth we aim to study the class of functions computed by small-pol...

IN - Informatika

  • 2010 - 2012
    • •
  • 926 tis. Kč
    • •
  • 926 tis. Kč
    • •
  • GA ČR
  • 1 - 10 out of 433