LightBlog
Contact at mumbai.academics@gmail.com or 8097636691/9323040215
Responsive Ads Here

Saturday, 3 March 2018

Theory of Computation

Theory of Computation
  • Automata and Languages
  • Regular languages
  • Context-free languages
  • Computability theory
  • The Church-Turing thesis
  • Decidability
  • Reducibility
  • Advanced topics in computability theory
  • Complexity theory
  • Time complexity
  • Space complexity
  • Intractability
  • Advanced topics in complexity theory
  • Preliminaries
  • Finite Automata and Regular Languages
  • Universal Models of Computation
  • Computability Theory
  • Complexity Theory: Foundations
  • Proving Problems Hard
  • Complexity Theory: The Frontier
  • Algorithms
  • Turing machines
  • Computability
  • Boolean logic
  • First-order logic
  • Undecidability in logic
  • P and NP
  • Relations between complexity classes
  • Reductions and completeness
  • NP-complete problems
  • coNP and function problems
  • Randomized computation
  • Cryptography
  • Approximability
  • On P vs. NP
  • Inside P
  • Parallel computation
  • Logarithmic space
  • Beyond NP
  • The polynomial hierarchy
  • Computation that counts
  • Polynomial space
  • No comments:

    Post a Comment