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...

Full description

Saved in:

Bibliographic Details
Published in:	Computational complexity Vol. 31; no. 2
Main Author:	Goldreich, Oded
Format:	Journal Article
Language:	English
Published:	Cham Springer International Publishing 01.12.2022 Springer Nature B.V
Subjects:	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 Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!