Search result for Np-hard problems Online Courses & Certifications
FollowFilter ![]()
Filter ![]()
Showing 8 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. This course, part of the Algorithms and Data Structures MicroMasters program, discusses inherently hard problems that you will come across in the real-world that do not have a known provably efficient algorithm, known as NP-Complete problems....
$150
Intro to Theoretical Computer Science
by Sebastian Wernicke , Sean Bennett , Sarah Norell- 0.0
-
![]()
![]()
![]()
![]()
![]()
Approx. 2 months
This will not only allow you to recognize some of the most challenging algorithmic problems out there, but also give you powerful tools to deal with them in practice. lesson 1 Challenging Problems An introduction to tough problems and their analysis. lesson 7 Ultimate Limits Problems that no computer can ever solve....
Free
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. This class includes many of the hard combinatorial problems that have been assumed for decades or even centuries to require exponential time, and we learn that either none or all of these problems have polynomial-time algorithms....
$129
Approximation Algorithms Part I
by Claire Mathieu- 4.8
-
![]()
![]()
![]()
![]()
![]()
Approx. 36 hours to complete
It is most likely impossible to solve such problems efficiently, so our aim is to give an approximate solution that can be computed in polynomial time and that at the same time has provable guarantees on its cost relative to the optimum. NP review...
Approximation Algorithms
by Mark de Berg- 4.7
-
![]()
![]()
![]()
![]()
![]()
Approx. 15 hours to complete
Many real-world algorithmic problems cannot be solved efficiently using traditional algorithmic tools, for example because the problems are NP-hard....
Advanced Algorithms (Graph Algorithms) in Java
by Holczer Balazs- 4.6
-
![]()
![]()
![]()
![]()
![]()
11 hours on-demand video
This course is about advanced algorithms (graph algorithms) focusing on graph traversal, shortest path problems, spanning trees and maximum flow problems and a lots of its applications from Google Web Crawler to taking advantage of stock market arbitrage situations. how to reduce most of the hard problems to maximum flow problem...
$14.99
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...
Related searches
Hardware Security
by Gang Qu- 4.3
-
![]()
![]()
![]()
![]()
![]()
Approx. 12 hours to complete
In this course, we will study security and trust from the hardware perspective. Upon completing the course, students will understand the vulnerabilities in current digital system design flow and the physical attacks to these systems. They will learn that security starts from hardware design and be familiar with the tools and skills to build secure and trusted hardware....
