<--- Back to Details
First PageDocument Content
Complexity classes / Circuit complexity / Arithmetic circuit complexity / Mathematical optimization / Polynomials / Schwartz–Zippel lemma / ACC0 / Circuit / PP / Theoretical computer science / Computational complexity theory / Applied mathematics
Date: 2011-03-10 13:51:53
Complexity classes
Circuit complexity
Arithmetic circuit complexity
Mathematical optimization
Polynomials
Schwartz–Zippel lemma
ACC0
Circuit
PP
Theoretical computer science
Computational complexity theory
Applied mathematics

Arithmetic Circuits: a survey of recent results and open questions Amir Shpilka 1

Add to Reading List

Source URL: www.cs.technion.ac.il

Download Document from Source Website

File Size: 1,17 MB

Share Document on Facebook

Similar Documents

Logical Methods in Computer Science Vol. 10(1:, pp. 1–29 www.lmcs-online.org Submitted Published

Logical Methods in Computer Science Vol. 10(1:, pp. 1–29 www.lmcs-online.org Submitted Published

DocID: 1xTZi - View Document

Logical Methods in Computer Science Vol. 2 (5:, pp. 1–31 www.lmcs-online.org Submitted Published

Logical Methods in Computer Science Vol. 2 (5:, pp. 1–31 www.lmcs-online.org Submitted Published

DocID: 1xTH1 - View Document

PP_icon-1_Einladung_A4_L3.indd

PP_icon-1_Einladung_A4_L3.indd

DocID: 1xTEi - View Document

ADVANCE INFORMATION  100 POEMS ARE NOT ENOUGHNon-Fiction > Poetry Walking BookFairs-PAN ǀ Rs 299 ǀ 104 pp

ADVANCE INFORMATION 100 POEMS ARE NOT ENOUGHNon-Fiction > Poetry Walking BookFairs-PAN ǀ Rs 299 ǀ 104 pp

DocID: 1xTyC - View Document

Logical Methods in Computer Science Vol. 4 (4:, pp. 1–21 www.lmcs-online.org Submitted Published

Logical Methods in Computer Science Vol. 4 (4:, pp. 1–21 www.lmcs-online.org Submitted Published

DocID: 1xTht - View Document