Normal view MARC view ISBD view

On Some Lower Bounds in Arithmetic Circuit Complexity Suryajith Chillara.

Material type: Text

TextPublisher: Chennai Chennai Mathematical Institute July 2017Description: 100 pages, vii 30 cms.Subject(s): Complexity TheoryOnline resources: Click here to access online

List(s) this item appears in: 2018-08-14

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

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 BHA R-equivalence and norm principles in algebraic groups.	T BHA On Non-Vanishing And Linear Independent Results	T CHA Torus Quotients and Automorphism group of a Bott-Samelson-Demazure-Hansen variety.	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	Next

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

Includes index and bibliography.

CMI Library