Lower bounds for natural functions in restricted boolean circuits

Bibliographic Details
Main Author:	Sengupta, Rimli
Format:	Others
Language:	en_US
Published:	Georgia Institute of Technology 2006
Subjects:	Computational complexity Algebra Boolean
Online Access:	http://hdl.handle.net/1853/8269

id	ndltd-GATECH-oai-smartech.gatech.edu-1853-8269
record_format	oai_dc
spelling	ndltd-GATECH-oai-smartech.gatech.edu-1853-82692013-12-15T03:31:14ZLower bounds for natural functions in restricted boolean circuitsSengupta, RimliComputational complexityAlgebraBooleanGeorgia Institute of Technology2006-03-10T19:26:20Z2006-03-10T19:26:20Z1995Dissertation239 bytestext/htmlhttp://hdl.handle.net/1853/8269413397en_USAccess restricted to authorized Georgia Tech users only.
collection	NDLTD
language	en_US
format	Others
sources	NDLTD
topic	Computational complexity Algebra Boolean
spellingShingle	Computational complexity Algebra Boolean Sengupta, Rimli Lower bounds for natural functions in restricted boolean circuits
author	Sengupta, Rimli
author_facet	Sengupta, Rimli
author_sort	Sengupta, Rimli
title	Lower bounds for natural functions in restricted boolean circuits
title_short	Lower bounds for natural functions in restricted boolean circuits
title_full	Lower bounds for natural functions in restricted boolean circuits
title_fullStr	Lower bounds for natural functions in restricted boolean circuits
title_full_unstemmed	Lower bounds for natural functions in restricted boolean circuits
title_sort	lower bounds for natural functions in restricted boolean circuits
publisher	Georgia Institute of Technology
publishDate	2006
url	http://hdl.handle.net/1853/8269
work_keys_str_mv	AT senguptarimli lowerboundsfornaturalfunctionsinrestrictedbooleancircuits
_version_	1716616954999996416

Similar Items