2018-T.A in Group theory and Spectroscopy, IIT Mandi

dirac_comb.pdf | |

File Size: | 401 kb |

File Type: |

2)**Title : **Phase transition in computationally complex systems

**Duration : **Feb 2016-Jul 2016

**Supervisor **: Dr. Samar Agnihotri

**Description :** There are longstanding problems such as satisfiability problem, traveling salesman Euler cycles and some of the optimization problems in field of computation. Till now, a polynomial time taking algorithm is not known neither the existence of a one. If one could find an algorithm to one of the problem, it can be used to all other problems. Such class of problems are called NP-complete problems. We are interested in viewing that those problems exhibit a phase transition from solvable to non- solvable. The solubility of a problem is studied from the phase transition curves obtained in the problem.

phase_transition.pdf | |

File Size: | 433 kb |

File Type: |

fokker_planck_paper.pdf | |

File Size: | 186 kb |

File Type: |

Powered by

✕