Search result for Np-complete problems Online Courses & Certifications
FollowFilter ![]()
Filter ![]()
Showing 12 courses
By Category ![]()
By Subject![]()
By Language![]()
By Duration![]()
By Price![]()
Get Course Alerts by Email
NP-Complete Problems
by Daniel Kane , Alexander S. Kulikov- 0.0
-
![]()
![]()
![]()
![]()
![]()
3 Weeks
Learn about NP-complete problems, known as hard problems that can’t be solved efficiently, and practice solving them using algorithmic techniques. Step into the area of more complex problems and learn advanced algorithms to help solve them. You will practice solving large instances of some of these problems despite their hardness using very efficient specialized software and algorithmic techniques including:...
$150
Computability, Complexity & Algorithms
by Charles Brubaker , Lance Fortnow , Hariharan Venkateswaran- 0.0
-
![]()
![]()
![]()
![]()
![]()
Approx. 0
Learn tools and techniques that will help you recognize when problems you encounter are intractable and when there an efficient solution. lesson 1 Computability Languages & Countability Turing Machines The Church-Turing Thesis lesson 2 Complexity P and NP NP-Complete Problems The Golden Ticket lesson 3 Algorithms Dynamic Programming Fast Fourier Transform Maximum Flow...
Free
Shortest Paths Revisited, NP-Complete Problems and What To Do About Them
by Tim Roughgarden- 4.8
-
![]()
![]()
![]()
![]()
![]()
Approx. 14 hours to complete
The primary topics in this part of the specialization are: shortest paths (Bellman-Ford, Floyd-Warshall, Johnson), NP-completeness and what it means for the algorithm designer, and strategies for coping with computationally intractable problems (analysis of heuristics, local search). Optional Theory Problems (Week 1) Polynomial-Time Solvable Problems NP Question Algorithmic Approaches to NP-Complete Problems...
Introduction to Graduate Algorithms
by Eric Vigoda , Arpan Chakraborty- 0.0
-
![]()
![]()
![]()
![]()
![]()
Approx. 3 months
The design and analysis of algorithms form an essential basis for computer science. This course is useful for those who want to pursue advanced studies in computer science, as well as those who want to work as a software engineer. Learn advanced techniques for designing algorithms and apply them to hard computational problems....
Free
Advanced Algorithms and Complexity
by Alexander S. Kulikov , Michael Levin , Daniel M Kane , Neil Rhodes- 4.6
-
![]()
![]()
![]()
![]()
![]()
Approx. 27 hours to complete
You've learned the basic algorithms now and are ready to step into the area of more complex problems and algorithms to solve them. Next we discuss inherently hard problems for which no exact good solutions are known (and not likely to be found) and how to solve them in practice. NP-complete Problems Search Problems...
Automata Theory
by Jeffrey D. Ullman- 0.0
-
![]()
![]()
![]()
![]()
![]()
7 Weeks
That lets us define problems to be "decidable" if their language can be defined by a Turing machine and "undecidable" if not. These are problems that, while they are decidable, have almost certainly no algorithm that runs in time less than some exponential function of the size of their input. The theory of intractability, or NP-complete problems...
$129
Quantum Mechanics and Quantum Computation
by Umesh V. Vazirani- 0.0
-
![]()
![]()
![]()
![]()
![]()
10 Weeks
The basics of quantum algorithms such as the quantum fourier transform, period finding, Shor's quantum algorithm for factoring integers, and the prospects for quantum algorithms for NP-complete problems...
$49
Related searches
Algorithmic Problems in Python
by Holczer Balazs- 4.5
-
![]()
![]()
![]()
![]()
![]()
6 hours on-demand video
NP-complete problems In each section we will talk about the theoretical background for all of these algorithms then we are going to implement these problems one by one. We will consider several recursion related problems such as factorial problem or Fibonacci numbers....
$15.99
Algorithms, Part II
by Robert Sedgewick , Kevin Wayne- 4.9
-
![]()
![]()
![]()
![]()
![]()
Approx. 63 hours to complete
Classifying Problems Search Problems NP Classifying Problems...
Advanced Data Structures in Java
by Leo Porter , Mia Minnes , Christine Alvarado- 4.8
-
![]()
![]()
![]()
![]()
![]()
Approx. 29 hours to complete
Route planning and NP-hard graph problems Core: NP Hard...
