Static and dynamic complexity of reachability, matching and related problems. Anish Mukherjee
By: Mukherjee, Anish.
Contributor(s): Datta, Samir [advisor.] | Arvind, V [advisor.] | Chennai Mathematical Institute [parent institute.].Material type: TextPublisher: Chennai. Chennai Mathematical Institute. c2019Description: xix, 135 p.; 29 cms.Subject(s): Algorithms | Complexity Theory
|Item type||Current location||Call number||Status||Date due||Barcode||Item holds|
|Reports/Dissertations||Chennai Mathematical Institute General Stacks||T MUK (Browse shelf)||Available||10784|
Univ. - Chennai Mathematical Institute; Degree - PhD Computer Science; Sub. on - May 2019. Guide: Prof. Samir Datta and V Arvind.