Normal view MARC view ISBD view

Algebraic Circuit Complexity: New Lower Bounds, Algorithms, and Applications Rajit Datta

Material type: Text

TextPublisher: Siruseri; Chennai Mathematical Institute c2021Description: xvi, 84 pages; 29 cms.Subject(s): -- Complexity TheoryOnline resources: Click here to access online

List(s) this item appears in: 2021-10-08

Item type	Current location	Call number	Status	Date due	Barcode	Item holds
Book	Chennai Mathematical Institute General Stacks	T DAT (Browse shelf)	Available		10918

Total holds: 0

Previous	No cover image available No cover image available	No cover image available No cover image available	No cover image available No cover image available	No cover image available No cover image available	No cover image available No cover image available	No cover image available No cover image available	No cover image available No cover image available	Next
Previous	T CHI On Some Lower Bounds in Arithmetic Circuit Complexity	T DAS On Generalised Parabolic HItchin Pairs.	T DAS Finiteness theorems for potentially equivalent Galois representations: extension of Faltings' finiteness criteria	T DAT Algebraic Circuit Complexity: New Lower Bounds, Algorithms, and Applications	T DAU Combinatorial and topological aspects of chain and planar polygon spaces	T GHA Flexible surfaces in 4-manifolds and embeddings of low dimensional manifolds	T GHO Asymptotic Symmetries, Horizon Hairm and Memory Effect	Next

Univ. - Chennai Mathematical Institute; Degree - PhD Computer Science; Sub. on - July 2021. Guide: Prof. Partha Mukhopadhyay.

CMI Library