Superpolynomial Lower Bounds for General Homogeneous Depth 4 Arithmetic Circuits

Mrinal Kumar; Shubhangi Saraf

doi:10.1007/978-3-662-43948-7_62

ScienceGate Book Chapters

BOOK-CHAPTER

Superpolynomial Lower Bounds for General Homogeneous Depth 4 Arithmetic Circuits

Mrinal Kumar Shubhangi Saraf

Year: 2014 Lecture notes in computer science Pages: 751-762 Publisher: Springer Science+Business Media

DOI: 10.1007/978-3-662-43948-7_62

Get Full-Text PDF Get Analytical Report

Keywords:

Bounded function Mathematics Homogeneous Upper and lower bounds Polynomial Electronic circuit Degree (music) Discrete mathematics Exponential function Monomial Combinatorics Mathematical analysis

Metrics

Cited By

4.43

FWCI (Field Weighted Citation Impact)

Refs

0.94

Citation Normalized Percentile

Is in top 1%

Is in top 10%

Citation History

Topics

Complexity and Algorithms in Graphs

Physical Sciences → Computer Science → Computational Theory and Mathematics

Cryptography and Data Security

Physical Sciences → Computer Science → Artificial Intelligence

Machine Learning and Algorithms

Physical Sciences → Computer Science → Artificial Intelligence

Superpolynomial Lower Bounds for General Homogeneous Depth 4 Arithmetic Circuits

Metrics

Citation History

Topics

Related Documents

Superpolynomial lower bounds for general homogeneous depth 4 arithmetic circuits

Superpolynomial Lower Bounds Against Low-Depth Algebraic Circuits

Lower bounds for bounded depth arithmetic circuits

Super-polynomial lower bounds for depth-4 homogeneous arithmetic formulas

Non-commutative arithmetic circuits: depth reduction and size lower bounds