CS748, 698D - Arithmetic Circuit Complexity (Sem II, 2015-16)

 

Links


Books, LectureS


Survey, Shpilka & Yehudayoff (FnTTCS, 2010).

Lower bound surveys in link.

PIT Surveys 1, 2, Saxena.

Book, Modern Computer Algebra, von zur Gathen & Gerhard.

Book, Finite Fields, Lidl & Niederreiter.

Book, Algorithmic Number Theory (Lattices, Number Fields, Curves and Cryptography), Edited by Joseph P. Buhler and Peter Stevenhagen.

Book, Algorithmic Number Theory, Bach & Shallit.

Course, Topics in Complexity, Kayal & Saha.
Course, Algebra and Computation, Madhu Sudan.
Course, Computational Number Theory and Algebra, Nitin Saxena.

Online Stuff


Arithmetic Circuit Complexity, Computational number theory, algebra.

Open problems, Adleman & McCurley.

History: Algebra.

------------------------------------------------------
``Algebra is generous; she often gives more than is asked of her.''

-- Jean d’Alembert (1717–1783).