Publications associées à Lower Bounds for Unambiguous Automata via Communication Complexity

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Rationally almost periodic sequences, polynomial multiple recurrence and symbolic dynamics

Florian Karl Richter

A set

R\subset \mathbb{N}

is called rational if it is well approximable by finite unions of arithmetic progressions, meaning that for every

\unicode[STIX]{x1D716}>0

there exists a set

B=\bigcup _{i=1}^{r}a_{i}\mathbb{N}+b_{i}

, where $a_{1},\ldots ,a_ ...

2019

Lower Bounds for Unambiguous Automata via Communication Complexity

Graph Chatbot

Chattez avec Graph Search

Byzantine consensus is Θ(n^2): the Dolev-Reischuk bound is tight even in partial synchrony!

Communication Complexity of Collision

The One-Way Communication Complexity of Submodular Maximization with Applications to Streaming and Robustness

Cooperative Data Exchange and Private Information Retrieval

Walkman: A Communication-Efficient Random-Walk Algorithm for Decentralized Optimization

Rationally almost periodic sequences, polynomial multiple recurrence and symbolic dynamics

String Matching: Communication, Circuits, and Learning

Scaling Functional Synthesis and Repair

Adventures in Monotone Complexity and TFNP

Labeled PSI from Fully Homomorphic Encryption with Malicious Security

Byzantine consensus is Θ(n^2): the Dolev-Reischuk bound is tight even in partial synchrony!

Communication Complexity of Collision

The One-Way Communication Complexity of Submodular Maximization with Applications to Streaming and Robustness

Cooperative Data Exchange and Private Information Retrieval

Walkman: A Communication-Efficient Random-Walk Algorithm for Decentralized Optimization

Rationally almost periodic sequences, polynomial multiple recurrence and symbolic dynamics

String Matching: Communication, Circuits, and Learning

Scaling Functional Synthesis and Repair

Labeled PSI from Fully Homomorphic Encryption with Malicious Security

Adventures in Monotone Complexity and TFNP