Skip to Main content Skip to Navigation
Theses

Contributions to arithmetic complexity and compression

Abstract : This thesis explores two territories of computer science: complexity and compression. More precisely, in a first part, we investigate the power of non-commutative arithmetic circuits, which compute multivariate non-commutative polynomials. For that, we introduce various models of computation that are restricted in the way they are allowed to compute monomials. These models generalize previous ones that have been widely studied, such as algebraic branching programs. The results are of three different types. First, we give strong lower bounds on the number of arithmetic operations needed to compute some polynomials such as the determinant or the permanent. Second, we design some deterministic polynomial-time algorithm to solve the white-box polynomial identity problem. Third, we exhibit a link between automata theory and non-commutative arithmetic circuits that allows us to derive some old and new tight lower bounds for some classes of non-commutative circuits, using a measure based on the rank of a so-called Hankel matrix. A second part is concerned with the analysis of the data compression algorithm called Lempel-Ziv. Although this algorithm is widely used in practice, we know little about its stability. Our main result is to show that an infinite word compressible by LZ’78 can become incompressible by adding a single bit in front of it, thus closing a question proposed by Jack Lutz in the late 90s under the name “one-bit catastrophe”. We also give tight bounds on the maximal possible variation between the compression ratio of a finite word and its perturbation—when one bit is added in front of it.
Document type :
Theses
Complete list of metadatas

Cited literature [50 references]  Display  Hide  Download

https://tel.archives-ouvertes.fr/tel-02452625
Contributor : Abes Star :  Contact
Submitted on : Thursday, January 23, 2020 - 3:36:09 PM
Last modification on : Friday, August 21, 2020 - 5:39:11 AM
Long-term archiving on: : Friday, April 24, 2020 - 3:32:29 PM

File

LAGARDE_Guillaume_2_complete_2...
Version validated by the jury (STAR)

Identifiers

  • HAL Id : tel-02452625, version 1

Citation

Guillaume Lagarde. Contributions to arithmetic complexity and compression. Computational Complexity [cs.CC]. Université Sorbonne Paris Cité, 2018. English. ⟨NNT : 2018USPCC192⟩. ⟨tel-02452625⟩

Share

Metrics

Record views

77

Files downloads

45