Improved bounds on the AN-complexity of O(1)-linear functions

We consider arithmetic circuits with arbitrary gates for computing Boolean functions that are represented by low-degree polynomials over GF(2). An adequate complexity measure for such circuits is the maximum between the arity of the gates and their number. This model and the corresponding complexity...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Computational complexity Jg. 31; H. 2
1. Verfasser:	Goldreich, Oded
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Cham Springer International Publishing 01.12.2022 Springer Nature B.V
Schlagworte:	Algorithm Analysis and Problem Complexity Arithmetic Boolean Boolean algebra Boolean functions Circuits Complexity Computation Computational Mathematics and Numerical Analysis Computer Science Gates (circuits) Linear functions Lower bounds Polynomials Upper bounds multilinear circuits restricted models of computation 68Q17 Arithmetic circuits
ISSN:	1016-3328, 1420-8954
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!