共 50 条
[31]
Functional Lower Bounds for Arithmetic Circuits and Connections to Boolean Circuit Complexity
[J].
31ST CONFERENCE ON COMPUTATIONAL COMPLEXITY (CCC 2016),
2016, 50
[33]
New Lower Bounds on Circuit Size of Multi-output Functions
[J].
Theory of Computing Systems,
2015, 56
:630-642
[36]
Super-polynomial lower bounds for depth-4 homogeneous arithmetic formulas
[J].
STOC'14: PROCEEDINGS OF THE 46TH ANNUAL 2014 ACM SYMPOSIUM ON THEORY OF COMPUTING,
2014,
:119-127
[37]
Lower Bounds on Key Derivation for Square-Friendly Applications
[J].
34TH SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE (STACS 2017),
2017, 66