Search Constraints

Number of results to display per page
Results for: Keywords Computational complexity Remove constraint Keywords: Computational complexity Year 2016 Remove constraint Year: 2016

Search Results

  • Courseware 
    Theory of Computation

    Theory of Computation

    Computability Theory deals with one of the most fundamental questions in computer science: What is computing and what are the limits of what a computer can compute? Or, formulated differently: “What kind of problems can be algorithmically solved?” During the course this question will be studied. Firstly, the notion of algorithm or computing will be made precise by using the mathematical model of a Turing machine. Secondly, it will be shown that basic issues in computer science, like “Given a program P does it halt for any input x?” or “Given two program P and Q, are they equivalent?” cannot be solved by any Turing machine. This shows that there exist problems that are impossible to solve with a computer, the so-called “undecidable problems”. The book is in English, the recorded lectures and slides however, are in Dutch

    Subjects:
    Computing, Data Science and Artificial Intelligence
    Keywords:
    Computable functions Machine theory Computational complexity
    Resource Type:
    Courseware
     
  • Courseware 
    Advanced Complexity Theory

    Advanced Complexity Theory

    This graduate-level course focuses on current research topics in computational complexity theory. Topics include: Nondeterministic, alternating, probabilistic, and parallel computation models; Boolean circuits; Complexity classes and complete sets; The polynomial-time hierarchy; Interactive proof systems; Relativization; Definitions of randomness; Pseudo-randomness and derandomizations;Interactive proof systems and probabilistically checkable proofs.

    Subjects:
    Mathematics and Statistics
    Keywords:
    Computational complexity
    Resource Type:
    Courseware