000			01060nam a22003137a 4500
003			IIITD
005			20260106020005.0
008			251231b |||||||| |||| 00| 0 eng d
020			_a9783642083983
040			_aIIITD
082	0	0	_aREF 004 _bVOL-I
100	1		_aVollmer, Heribert
245	1	0	_aIntroduction to circuit complexity : _ba uniform approach _cby Heribert Vollmer
260			_aNew York : _bSpringer, _c©1999
300			_axi, 270 p. : _bill. ; _c24 cm.
440		0	_aTexts in theoretical computer science
504			_aIncludes bibliographical references and indexes.
505			_t1. Complexity Measures and Reductions
505			_t2. Relations to other Computation Models
505			_t3. Lower Bounds
505			_t4. The NC Hierarchy
505			_t5. Arithmetic Circuits
505			_t6. Polynomial Time and Beyond
650		0	_aElectronic digital computers _xCircuits _xDesign.
650		0	_aLogic, Symbolic and mathematical.
650		0	_aAlgebra, Boolean.
650		0	_aComputational complexity.
942			_2ddc _cREF _01
999			_c209491 _d209491