Hola,
¿eres nuevo aquí?

Registrate y conecta tu empresa con financiación pública, partners y proyectos.

HARMONIC

Financiado

Discrete harmonic analysis for computer science

Boolean function analysis is a topic of research at the heart of theoretical computer science. It studies functions on n input bits (for example, functions computed by Boolean circuits) from a spectral perspective, by treating the... ver más

28/02/2025

TECHNION ISRAEL I...

1M€

Presupuesto del proyecto: 1M€

Líder del proyecto

TECHNION ISRAEL INSTITUTE OF TECHNOLOGY No se ha especificado una descripción o un objeto social para esta compañía.

TRL 4-5

Ver 2 Participantes

Financiación concedida El organismo H2020 notifico la concesión del proyecto el día 2018-08-27

Línea de financiación objetivo El proyecto se financió a través de la siguiente ayuda:

ERC-2018-STG: ERC Starting Grant

I+D

Cerrada hace 7 años

0% 100% 100%

2 Participantes

TECHNION ISRAEL INSTITUTE O...

1.47M€ | Lider

INDUSTRIAL GALVANIZADORA

349.65K€ | Participante

Últimas noticias

30-11-2024: Cataluña Gestión For... Se ha cerrado la línea de ayuda pública: Gestión Forestal Sostenible para Inversiones Forestales Productivas para el organismo:

29-11-2024: IDAE En las últimas 48 horas el Organismo IDAE ha otorgado 4 concesiones

29-11-2024: ECE En las últimas 48 horas el Organismo ECE ha otorgado 2 concesiones

Duración del proyecto: 78 meses Fecha Inicio: 2018-08-27
Fecha Fin: 2025-02-28

Líder del proyecto

TECHNION ISRAEL INSTITUTE OF TECHNOLOGY

TRL 4-5

Presupuesto del proyecto 1M€

Descripción del proyecto Boolean function analysis is a topic of research at the heart of theoretical computer science. It studies functions on n input bits (for example, functions computed by Boolean circuits) from a spectral perspective, by treating them as real-valued functions on the group Z_2^n, and using techniques from Fourier and functional analysis. Boolean function analysis has been applied to a wide variety of areas within theoretical computer science, including hardness of approximation, learning theory, coding theory, and quantum complexity theory. Despite its immense usefulness, Boolean function analysis has limited scope, since it is only appropriate for studying functions on {0,1}^n (a domain known as the Boolean hypercube). Discrete harmonic analysis is the study of functions on domains possessing richer algebraic structure such as the symmetric group (the group of all permutations), using techniques from representation theory and Sperner theory. The considerable success of Boolean function analysis suggests that discrete harmonic analysis could likewise play a central role in theoretical computer science. The goal of this proposal is to systematically develop discrete harmonic analysis on a broad variety of domains, with an eye toward applications in several areas of theoretical computer science. We will generalize classical results of Boolean function analysis beyond the Boolean hypercube, to domains such as finite groups, association schemes (a generalization of finite groups), the quantum analog of the Boolean hypercube, and high-dimensional expanders (high-dimensional analogs of expander graphs). Potential applications include a quantum PCP theorem and two outstanding open questions in hardness of approximation: the Unique Games Conjecture and the Sliding Scale Conjecture. Beyond these concrete applications, we expect that the fundamental results we prove will have many other applications that are hard to predict in advance.

Conecta tu I+D

Entra hoy

Financiación

Empresas

CTIs/Universidades

Proyectos

Investigadores