Table Of Content

Introduction to Arithmetic Circuit Complexity Amir Shpilka Technion 1 Arithmetic Circuits March 29, 2014 Goal of talk Survey results in arithmetic circuit complexity! •  Lower Bounds! •  Identity Testing! •  Reconstruction/Interpolation/Learning! Highlight some `next step’ open problems! •  Mostly for restricted models! •  Show why these models/questions are interesting! ! 2 Arithmetic Circuits March 29, 2014 Talk outline •  Definition of the Model! •  Classical Results ! •  Lower Bounds! •  Identity Testing ! •  Reconstruction/Interpolation/Learning! ! 3 Arithmetic Circuits March 29, 2014 Arithmetic Circuits Field: 𝔽! Variables: X ,...,X ! 1 n Gates: +, ×! Every gate in the   circuit computes a   polynomial in 𝔽 [X ,...,X ]! 1 n Example: (X ⋅ X ) ⋅ (X + 1)! 1 2 2 Size = number of gates! Depth = length of longest input-output path! Degree = max degree of internal gates! ! 4 Arithmetic Circuits March 29, 2014 Arithmetic Formulas Same, except underlying graph is a tree! 5 Arithmetic Circuits March 29, 2014 Motivation •  Most natural model for computing polynomials! •  For many problems (e.g. Matrix Multiplication, Det) best algorithm is by an arithmetic circuit! •  Great algorithmic achievements:! –  Fourier Transform! –  Matrix Multiplication! –  Polynomial Factorization! •  Structured model (compared to Boolean circuits) P vs. NP may be easier! 6 Arithmetic Circuits March 29, 2014 Important Problems Design new algorithms:! –  Õ(n2) for Matrix Multiplication?! –  Polynomial Factorization without depth increase?! Prove lower bounds:! –  Find a polynomial that requires super polynomial size or super logarithmic depth.! Derandomize Polynomial Identity Testing:! –  Given (explicitly or as black-boxed) two arithmetic circuits, decide whether they compute the same polynomial.! Reconstruction of arithmetic circuits:! –  Compute the circuit from its evaluations.! 7 Arithmetic Circuits March 29, 2014 The classics f of degree r computed by size s depth d circuit then:! •  ∂f/∂x ,…,∂f/∂x have size O(s), depth O(d) circuit! 1 n •  Size O(sr2) circuit of depth O(d log(r)) computing all homogeneous components of f! •  Each factor of f has poly(s,r) size circuit! ! If we only have black-box access to f then:! •  Can get BB access to each ∂f/∂x by querying f O(r) k queries for each query to ∂f/∂x ! k •  Same for homogeneous component of f! •  Can get BB access to each factor of f (uses randomness)! 8 Arithmetic Circuits March 29, 2014 The classics: Valiant’s work Valiant defined arithmetic analogs of P and NP : •  VP: All polynomials that have poly size arithmetic circuits of polynomial degree. ! •  VNP: all polys f that for some g in VP   f(x ,…,x )=Σ{g(x ,…,x ,e ,…,e ) : e ,…,e ∈ {0,1}}! 1 n 1 n 1 m 1 m Hard problems:! •  For all f in VP there is matrix A, s.t. Det(A) = f, entries of A in {𝔽,X ,...,X }, size of A is nO(log n).! 1 n •  For all f in VNP ∃ matrix A, s.t. Perm(A) = f,   entries of A in {𝔽,X ,...,X }, size of A is poly(n). 1 n 9 Arithmetic Circuits March 29, 2014 The classics: Valiant’s work Valiant defined VP, VNP and showed that:! •  For all f in VNP there is matrix A, s.t. Perm(A) = f,   entries of A in {𝔽,X ,...,X }, size of A is poly(n). 1 n •  For all f in VP there is matrix A, s.t. Det(A) = f,   entries of A in {𝔽,X ,...,X }, size of A is nO(log n).! 1 n To show VP ≠ VNP enough to prove that any such A with det(A) = Perm(X) has size nω(log n)! Best bound [Mignon-Ressayre, Cai-Chen-Li]   size(A) = Ω(n2)! Open Problem 1: Prove size(A) ≥ 2n2! 10 Arithmetic Circuits March 29, 2014

Description:

[Raz-S-Yehudayoff]: n1+ε lower bound for circuits. Tools: (shifted) partial derivatives (+ random restrictions) as complexity measure. Open problem 3:

Introduction to Arithmetic Circuit Complexity PDF

96 Pages·2014·0.5 MB·English

Checking for file health...

Download

Upgrade Premium

Most books are stored in the elastic cloud where traffic is expensive. For this reason, we have a limit on daily download.

Introduction to Arithmetic Circuit Complexity • Digital Edition • Free Download

By | File: 0.5| English| 2014

The digital edition of "Introduction to Arithmetic Circuit Complexity" is available from our community library collection.

Retrieve Document

Resource Overview

[Raz-S-Yehudayoff]: n1+ε lower bound for circuits. Tools: (shifted) partial derivatives (+ random restrictions) as complexity measure. Open problem 3:

Publication Details

Title:	Introduction to Arithmetic Circuit Complexity
Author:
Published by:
Publication date:	2014
ISBN:
Document length:	96 pages
Written in:	English
Digital size:	0.5
Access type:	Library Collection • No Cost

Reader Resources

Digital Reading Tips

This document works on all major e-readers and devices
Adjust brightness for comfortable extended reading
Use bookmarking features to track your progress
Searchable text helps locate specific content quickly

Library Collection Policy

Zlibrary.cc maintains an extensive collection of digital documents for educational and research purposes. We believe in providing access to knowledge for all.

Access "Introduction to Arithmetic Circuit Complexity" Document

Available in multiple formats • No account creation required

Common Questions

Is this the complete version of "Introduction to Arithmetic Circuit Complexity"?

Yes, this is the complete digital edition of "Introduction to Arithmetic Circuit Complexity" by . The document includes all content from the original publication with no omissions.

What is Zlibrary.cc's approach to digital resources?

Zlibrary.cc serves as a catalog and access point to educational materials freely available across the internet. We do not host these files on our servers but provide links to sources where they can be accessed. Our mission is to support education and research by making knowledge more discoverable. Users should adhere to copyright laws in their jurisdiction when accessing these resources.