You are currently browsing the tag archive for the ‘arithmetic circuits’ tag.
Avi Wigderson‘s final talk in his Distinguished Lecture Series on “Computational complexity” was entitled “Arithmetic computation“; the complexity theory of arithmetic circuits rather than boolean circuits.

Recent Comments