Summary: Introductio To Computational Complexity

Study material generic cover image
  • This + 400k other summaries
  • A unique study and practice tool
  • Never study anything twice again
  • Get the grades you hope for
  • 100% sure, 100% understanding
Use this summary
Remember faster, study better. Scientifically proven.
Trustpilot Logo

Read the summary and the most important questions on Introductio to Computational Complexity

  • 2 Finite state automata

  • 2.2 Deterministic finite automate (DFA's)

    This is a preview. There are 2 more flashcards available for chapter 2.2
    Show more cards here

  • DFA definition with the 5-tuple M

    (Q, Σ, delta, q_0, F)
  • Transition function (syntax)

    Delta : Q x Σ → Q
  • 3 Turing machines

  • 3.3 A better approach to identfiy (even) palindromes

    This is a preview. There are 4 more flashcards available for chapter 3.3
    Show more cards here

  • Quadruatic (worst-case) runtime

    Ntot = n^2/2 + 5n/2 scales q uadratically in the length n of bitstring to be processed --> iterative checking procedure
  • 3.4.5 History

  • Who is Alan Turing (1912 - 1954)

    An English mathematician and computer scientist --> father of both AI and theoretical copmuter sicence.
  • 4 Decision problems and languages

    This is a preview. There are 1 more flashcards available for chapter 4
    Show more cards here

  • 4.1 Three points of view on computational challenges

    This is a preview. There are 4 more flashcards available for chapter 4.1
    Show more cards here

  • The most elementary building blocks of information

    Symbols taken from an alphabet
  • Two very important/usefull languages

    The empty lanague, language of all strings
  • 3 ways to describe the same underlaying concept

    Decision problems, boolean functions and languages
  • 6 Time-bounded computations

    This is a preview. There are 2 more flashcards available for chapter 6
    Show more cards here

  • Difference between computability and computational complexity

    Computability focuses on what can be computed, while computational complexity studies the resources required for computation (how expensive)
  • 6.1 Motvation : multiplication vs factorization

    This is a preview. There are 8 more flashcards available for chapter 6.1
    Show more cards here

  • Gradeschool multiplication algortihm

    Multiply each digit of the second number by each digit of the first number and then add the results.
  • Factorization as cryptographic primitive

    The key idea is that users create a public key based on two large prime numbers and an axiliary value that they publish The prime numbers are being kept a secret --> can only be decoded by someone who knows them

To read further, please click:

Read the full summary
This summary +380.000 other summaries A unique study tool A rehearsal system for this summary Studycoaching with videos
  • Higher grades + faster learning
  • Never study anything twice
  • 100% sure, 100% understanding
Discover Study Smart