CCU Graduate Algorithms

@ccugraduatealgorithms260

27 tuit
9 Sorting by Reversal (English)
Formal & Physical Sciences Computing & Cybersecurity
EN

9 Sorting by Reversal (English)

CCU Graduate Algorithms
32 min
★ ★ ★ ★ ☆ 4/5
AlgorithmReversal DistanceGenome Rearrangement
8 Approximation Algorithm (English)
Formal & Physical Sciences Computing & Cybersecurity
EN

8 Approximation Algorithm (English)

Yao-Ting Huang
39 min
★ ★ ★ ★ ☆ 4/5
Approximation AlgorithmsNP-HardnessVertex Cover
7 Subset Sum (English)
Formal & Physical Sciences Computing & Cybersecurity
EN

7 Subset Sum (English)

CCU Graduate Algorithms
20 min
★ ★ ★ ☆ ☆ 3/5
Subset SumNP-CompletenessAlgorithms
6 Graph Problems (English)
Formal & Physical Sciences Computing & Cybersecurity
EN

6 Graph Problems (English)

CCU Graduate Algorithms
27 min
★ ★ ★ ★ ☆ 4/5
NP-CompletenessGraph AlgorithmsComplexity Theory
5 SAT Problems (English)
Formal & Physical Sciences Computing & Cybersecurity
EN

5 SAT Problems (English)

CCU Graduate Algorithms
34 min
★ ★ ★ ★ ☆ 4/5
SATNP-CompletenessAlgorithms
4 P, NP, NP completeness (English)
Formal & Physical Sciences Computing & Cybersecurity
EN

4 P, NP, NP completeness (English)

Yao-Ting Huang
53 min
★ ★ ★ ★ ☆ 4/5
P vs NPNP-CompleteComplexity Classes
3 Dynamic Programming (English)
Formal & Physical Sciences Computing & Cybersecurity
EN

3 Dynamic Programming (English)

CCU Graduate Algorithms
60 min
★ ★ ★ ★ ☆ 4/5
Dynamic ProgrammingAlgorithmsLongest Common Subsequence
2 Divide and Conquer (English)
Formal & Physical Sciences Computing & Cybersecurity
EN

2 Divide and Conquer (English)

CCU Graduate Algorithms
15 min
★ ★ ★ ★ ☆ 4/5
Divide and ConquerBig O NotationComplexity Analysis
14 Linear Programming Relaxation
Formal & Physical Sciences Mathematics
EN

14 Linear Programming Relaxation

CCU Graduate Algorithms
63 min
★ ★ ★ ★ ★ 5/5
Linear ProgrammingInteger ProgrammingApproximation Algorithms
11 Set Cover (English)
Formal & Physical Sciences Computing & Cybersecurity
EN

11 Set Cover (English)

CCU Graduate Algorithms
28 min
★ ★ ★ ★ ☆ 4/5
Set CoverApproximation AlgorithmsGreedy Algorithm
10 Bin Packing (English)
Formal & Physical Sciences Computing & Cybersecurity
EN

10 Bin Packing (English)

Yao-Ting Huang
49 min
★ ★ ★ ★ ☆ 4/5
Bin PackingFirst-Fit AlgorithmApproximation Algorithm
CCU Graduate Algorithm 2024 10/11
Formal & Physical Sciences Computing & Cybersecurity
EN

CCU Graduate Algorithm 2024 10/11

CCU Graduate Algorithms
102 min
★ ★ ★ ★ ☆ 4/5
NP-CompleteSAT3SAT
20161115 Sorting by Reversal
Formal & Physical Sciences Computing & Cybersecurity
EN

20161115 Sorting by Reversal

CCU Graduate Algorithms
68 min
★ ★ ★ ★ ☆ 4/5
Sorting by ReversalApproximation AlgorithmGenome Rearrangement
CCU Graduate Algorithm 2016 P and NP
Formal & Physical Sciences Computing & Cybersecurity
EN

CCU Graduate Algorithm 2016 P and NP

CCU Graduate Algorithms (instructor not named)
46 min
★ ★ ★ ★ ☆ 4/5
P vs NPComputational ComplexityPolynomial Time
CCU Graduate Algorithm 2015 P and NP
Formal & Physical Sciences Computing & Cybersecurity
EN

CCU Graduate Algorithm 2015 P and NP

CCU Graduate Algorithms
46 min
★ ★ ★ ★ ☆ 4/5
P vs NPComplexity TheoryPolynomial Time
CCU Graduate Algorithm 2015 NP-completeness
Formal & Physical Sciences Computing & Cybersecurity
EN

CCU Graduate Algorithm 2015 NP-completeness

CCU Graduate Algorithms
57 min
★ ★ ★ ★ ☆ 4/5
NP-CompletenessPolynomial-Time ReductionP vs NP