Unifying lower bounds for algebraic machines, semantically

This paper presents a new abstract method for proving lower bounds in computational complexity. Based on the notion of topological and measurable entropy for dynamical systems, it is shown to generalise three previous lower bounds results from the literature in algebraic complexity. We use it to pro...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	arXiv.org 2024-10
Hauptverfasser:	Seiller, Thomas, Pellissier, Luc, Ulysse Léchine
Format:	Artikel
Sprache:	eng
Schlagworte:	Algebra Complexity theory Dynamical systems Integers Lower bounds Mathematical models Random access
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!