Exploring Size Complexity and Randomness in the Query Model [HBNI Th245]

Yogesh Dahiya

dc.contributor.author	Yogesh Dahiya
dc.date.accessioned	2024-06-28T07:12:33Z
dc.date.available	2024-06-28T07:12:33Z
dc.date.issued	2024
dc.date.submitted	2024-06-04
dc.identifier.uri	https://dspace.imsc.res.in/xmlui/handle/123456789/881
dc.description.abstract	A central goal of computer science is to understand the capabilities and limitations of various computational devices. To understand various computational devices we formalize them using mathematical models called "models of computation". Examples of models of computation include Turing Machines, Quantum Machines, Formulas & Circuits, Communication Protocols, Proof Systems, and Decision Trees. Among various models, some find practical, physical implementations, while others are more like abstract constructs that help us explore many avatars of computation	en_US
dc.description.tableofcontents	1. Query Model of Computation 2. Rank 3. Role of Randomness in Decision Tree Size 4. The (And, Or) and And Query Models 5. Linear Decision Trees	en_US
dc.publisher.publisher	The Institute of Mathematical Sciences
dc.title	Exploring Size Complexity and Randomness in the Query Model [HBNI Th245]	en_US
dc.type.degree	Ph.D	en_US
dc.type.institution	HBNI	en_US
dc.description.advisor	Meena Mahajan
dc.description.pages	xxii, 205p.	en_US
dc.type.mainsub	Computer Science	en_US
dc.type.hbnibos	Mathematical Sciences	en_US