Derandomizing Algorithms for Combinatorial Optimization Problems
Implementing Organization
Indian Institute of Technology (IIT), Bombay
Principal Investigator
Dr. Rohit Gurjar
Indian Institute of Technology (IIT), Bombay
About
The derandomization question lies at the intersection of algorithm design and lower bounds. Some of our recent works were on derandomizing the famous Isolation Lemma for various combinatorial families. Some of these implied derandomizations of known algebraic algorithms for various combinatorial optimization problems. While in some other works, we got a parallel equivalence between search and decision versions. PIs propose to pursue two lines of investigation - (i) obtaining new algorithmic results based on our derandomization of the Isolation Lemma in the most general setting and (ii) derandomize known algebraic algorithms for various combinatorial problems.
Patents
0
Source
Source
Science and Engineering Research Board (SERB), DST 2022-23
Science and Engineering Research Board (SERB), New Delhi
Anusandhan National Research Foundation (ANRF)
Quick Information
Area of Research
Mathematical Sciences
Start Year
2023
End Year
2026
Sanction Amount
₹ 6.60 L
Status
Ongoing
Contact
rohitgurjar0@gmail.com
Output
No. of Research Paper
00
Technologies (If Any)
00
No. of PhD Produced
00
No. of Patents
Filed :00
Grant :00
Disclaimer:
Information available on this portal is sourced from various organizations and is provided for informational purposes only. Users are advised to verify details from the respective official sources.
Please enter your details
Please provide your name and email to continue. Your details are saved in this browser for future use.
Latest Updates
Loading…
⚠️
You are leaving this website
You are about to be redirected to an external website that is not operated by
India Science, Technology & Innovation (ISTI) Portal.
Indian Institute of Technology (IIT), Bombay
Acces sibility Controls