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”

Filters

2 150 (0,122s)

Project

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

The project focuses on the fundamental research into the optimality of passive an understanding of the physical bounds on the primary physical quantities as well as system-objective bounds. This project strives to fill a ga...

Applied mathematics

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

Theoretical Limits of Light-Matter Interactions (GA24-11678S)

in the growing field of fundamental bounds on electromagnetic phenomena by setting and convex optimization, which proved extremely fruitful in prior studies of fundamental bounds. The methods developed in the proj...

Applied mathematics

  • 2024 - 2026
  • 7 711 tis. Kč
  • 7 711 tis. Kč
  • GA ČR
Project

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

We study weak logical systems, guided by the question: what is the weakest natural theory in which we can prove a mathematical statement? This question is often fundamentally complexity theoretic in nature, as proofs in such weak systems can...

Pure mathematics

  • 2019 - 2022
  • 9 171 tis. Kč
  • 8 514 tis. Kč
  • GA ČR
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

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

lower bounds, showing that the existence of significantly faster algorithms. In this research proposal we target on several fundamental problems in network design related that of the existing algorithms, or to obtain lower bo...

IN - Informatika

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

"Introducing innovations for the expansion of Aireen a.s. on foreign markets" (FX05030132_7907)

"The subject of the project is the introduction of a series of innovations which, as a result, will increase by leaps and bounds competitiveness of the company and will allow Aireen to break through with a Diabetic diagnostic solution retin...

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

  • 2024 - 2025
  • 14 960 tis. Kč
  • 7 246 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

The Moral Authority of the State Trust, Market, Consent (GA24-12180S)

This project seeks to re-examine the fundamental question of the moral authority of the liberal state from Hobbes to contemporary political philosophers such as Nozick, Oakeshott, Ripstein and AJ Simmons. Neo-Lockeans like Nozick claim-Kanti...

Philosophy, History and Philosophy of science and technology

  • 2024 - 2026
  • 1 343 tis. Kč
  • 1 343 tis. Kč
  • GA ČR
  • 1 - 10 out of 2 150