-
Niranka Banerjee
(The Institute of Mathematical Sciences, 2021)
To analyze an algorithm for a graph problem the traditional notion is to assume that a graph is static. However, for most real world applications graphs are constantly modified. These modifications can be in terms of ...
-
Saket Saurabh
(The Institute of Mathematical Sciences, 2009)
The class of NP-hard combinatorial optimization problems, need to be solved exactly for various applications in theory and practice, brings the need for exact algorithms. Parameterized complexity is an exact algorithmic ...
-
Limaye, Nutan
(The Institute of Mathematical Sciences, 2010)
The Complexity classes contained in LogCFL is explored in this thesis by drawing connections to Language theory. Many depth reduction techniques involved in this process are studied along the way. The two factor-2 ...
-
Aravind, N. R.
(The Institute of Mathematical Sciences, 2011)
This thesis deals mainly with two related coloring problems - forbidden subgraph
colorings and oriented colorings. The former deals with proper colorings of vertices or edges of a graph with constraints on the union of ...
-
Suresh, S. P.
(2009-09-09)
One of the central problems in the automatic verification of security protocols is that of verifying whether a given protocol leaks secrets or not. It identifies syntactic subclasses of protocols for which the secrecy ...
-
Geevarghese Philip
(The Institute of Mathematical Sciences, 2012)
Polynomial-time preprocessing is a simple algorithmic strategy which has been
widely employed in practice to tackle hard problems. The quantification and
analysis of the efficiency of preprocessing algorithms are, in a ...
-
Neeldhara Misra
(The Institute of Mathematical Sciences, 2012)
In this thesis, the parameterized framework is used for the design and analysis
of algorithms for NP-complete problems. This amounts to studying the parameterized
version of the classical decision version. Herein, the ...
-
Phawade Ramchandra Babasaheb
(The Institute of Mathematical Sciences, 2014)
Petri nets are a formal model of concurrent systems. They were first defined by Petri in
his thesis [Pet62] and were presented at the IFIP 1962 congress in Munich [Pet63]. Nets
are widely used in modelling various aspects ...
-
Simon, Sunil Easaw
(The Institute of Mathematical Sciences, 2010)
The Main theme of this thesis is reasoning about strategies in games in logical framework. Logical analyses of games typically consider players' strategies as atomic objects and the reasoning is about existence of strategies ...
-
Ramit Das
(The Institute of Mathematical Sciences, )
This work is about analysing reasoning about games - specially the social network
games, polymatrix games, priority separable games and large games. Towards the
reasoning we employ di↵erent logics - namely the least fixed ...
-
Anuj Tawari
(The Institute of Mathematical Sciences, 2019)
One of the major aims of theoretical computer science is to understand what is the
most efficient way to perform a given task with limited computational resources.
In this thesis, some absolutely tight lower bounds are ...
-
Syed Mohammad Meesum
(The Institute of Mathematical Sciences, 2017)
In this thesis we design algorithms for the matrix rigidity problem and its variants and study their hardness in the framework of
parameterized complexity. The rigidity of a matrix is a classical concept ...
-
Swarup Kumar, Mohalik
(, 2009-08-19)
It is aimed to study the models of concurrency in the context of finite state systems, in order to understand the nature of distributed computing, and to help the design and analysis of distributed systems. Process models ...
-
Abhranil Chatterjee
(The Institute of Mathematical Sciences, 2022)
Algebraic Complexity is the study of the complexity of computing multivariate
polynomials where the complexity of a polynomial is the number of arithmetic
operations such as additions, and multiplications required to ...
-
Srikanth Srinivasan
(The Institute of Mathematical Sciences, 2011)
Proving lower bounds has been a notoriously hard problem for Theoretical Computer Scientists. The purpose of this thesis is to supplement the efforts in many theorems regarding lower bounds in restricted models of ...
-
Ashwin Jacob
(The Institute of Mathematical Sciences, 2022)
-
Swaroop, N.P.
(The Institute of Mathematical Sciences, 2019)
For a univariate polynomial with real coefficients, a bound on its positiveness is a positive real number B such that the polynomial is non-negative at
every value larger than B. One of the best known bounds in literature ...
-
Kunal Dutta
(The Institute of Mathematical Sciences, 2014)
This thesis studies four problems on graphs using the Probabilistic Method. The first two
are finding the maximum size of an induced acyclic tournament and acyclic subgraph respectively, in random directed graphs. The ...
-
Partha Mukhopadhyay
(The Institute of Mathematical Sciences, 2009)
The polynomial identity Testing problem and its connection to several other important complexity theoretic problems are studied in this thesis. Polynomial identity testing problem is considered over commutative and non ...
-
Anil Shukla
(The Institute of Mathematical Sciences, 2017)
Propositional proof complexity–a sub-branch of computational complexity–is an extensively studied area, with a number of lower bound techniques for various propositional proof systems (for example Resolution, and Cutting ...