Algorithmics at Universität Mannheim

Flashcards and summaries for Algorithmics at the Universität Mannheim

Arrow Arrow

It’s completely free

studysmarter schule studium
d

4.5 /5

studysmarter schule studium
d

4.8 /5

studysmarter schule studium
d

4.5 /5

studysmarter schule studium
d

4.8 /5

Study with flashcards and summaries for the course Algorithmics at the Universität Mannheim

Exemplary flashcards for Algorithmics at the Universität Mannheim on StudySmarter:

Which grows strictly faster?

Exemplary flashcards for Algorithmics at the Universität Mannheim on StudySmarter:

Which grows faster?

Exemplary flashcards for Algorithmics at the Universität Mannheim on StudySmarter:

Is it allowed to walk a edge two times in a Hamilton circuit?

Exemplary flashcards for Algorithmics at the Universität Mannheim on StudySmarter:

When is d an extremal point in X(I) with regard to the slacking extension?

Exemplary flashcards for Algorithmics at the Universität Mannheim on StudySmarter:

Which grows strictly faster?

Exemplary flashcards for Algorithmics at the Universität Mannheim on StudySmarter:

Name apparently unfeasible problems.

Exemplary flashcards for Algorithmics at the Universität Mannheim on StudySmarter:

Define NPC.

Exemplary flashcards for Algorithmics at the Universität Mannheim on StudySmarter:

State an NP-complete problem. 

Exemplary flashcards for Algorithmics at the Universität Mannheim on StudySmarter:

How to show that a NP-problem L is np-complete?

Exemplary flashcards for Algorithmics at the Universität Mannheim on StudySmarter:

Describe the Growth order of the Simplex Method.

Exemplary flashcards for Algorithmics at the Universität Mannheim on StudySmarter:

When does the point d fulfill n independent restrictions in I with equality?

Exemplary flashcards for Algorithmics at the Universität Mannheim on StudySmarter:

When is it true that d in X(I) in regard to the slacking extension?

Your peers in the course Algorithmics at the Universität Mannheim create and share summaries, flashcards, study plans and other learning materials with the intelligent StudySmarter learning app.

Get started now!

Flashcard Flashcard

Exemplary flashcards for Algorithmics at the Universität Mannheim on StudySmarter:

Algorithmics

Which grows strictly faster?
Sublinear n^{c}

Algorithmics

Which grows faster?
Polynomial n^k

Algorithmics

Is it allowed to walk a edge two times in a Hamilton circuit?

Yes

Algorithmics

When is d an extremal point in X(I) with regard to the slacking extension?

If the slacking extension of d is zero at n linearly independent positions and ist positive at every position.

Algorithmics

Which grows strictly faster?
n^{k}

Algorithmics

Name apparently unfeasible problems.

  • SAT: Satisfiability of Boolean formal in conjunctive normal /CNF-formulas)
  • Traveling Salesman Problem
  • Maximum Clique Problem
  • Solving Linear Integer Programs
  • Computation of Discrete Logarithms and Integer Factorization

Algorithmics

Define NPC.

class of NP-complete problems

Algorithmics

State an NP-complete problem. 

SAT (Cook Theorem)

Algorithmics

How to show that a NP-problem L is np-complete?

  • find an appropriate NP-complete problem L'
  • and construct a polynomial reduction g form L' to L

Algorithmics

Describe the Growth order of the Simplex Method.

  • Worst case running time is exponential in n and m
  • average running time is polynomial
  • in practice the simplex method performs well

Algorithmics

When does the point d fulfill n independent restrictions in I with equality?

If the slacking extension of d is zero at n linearly independent positions

Algorithmics

When is it true that d in X(I) in regard to the slacking extension?

If d has only nonnegative components

Sign up for free to see all flashcards and summaries for Algorithmics at the Universität Mannheim

Singup Image Singup Image
Wave

Other courses from your degree program

For your degree program Algorithmics at the Universität Mannheim there are already many courses on StudySmarter, waiting for you to join them. Get access to flashcards, summaries, and much more.

Back to Universität Mannheim overview page

What is StudySmarter?

What is StudySmarter?

StudySmarter is an intelligent learning tool for students. With StudySmarter you can easily and efficiently create flashcards, summaries, mind maps, study plans and more. Create your own flashcards e.g. for Algorithmics at the Universität Mannheim or access thousands of learning materials created by your fellow students. Whether at your own university or at other universities. Hundreds of thousands of students use StudySmarter to efficiently prepare for their exams. Available on the Web, Android & iOS. It’s completely free.

Awards

Best EdTech Startup in Europe

Awards
Awards

EUROPEAN YOUTH AWARD IN SMART LEARNING

Awards
Awards

BEST EDTECH STARTUP IN GERMANY

Awards
Awards

Best EdTech Startup in Europe

Awards
Awards

EUROPEAN YOUTH AWARD IN SMART LEARNING

Awards
Awards

BEST EDTECH STARTUP IN GERMANY

Awards