EXP-Time

Data Skeptic

In this episode we discuss the complexity class of EXP-Time which contains algorithms which require time to run. In other words, the worst case runtime is exponential in some polynomial of the input size. Problems in this class are even more difficult than problems in since you can't even verify a solution in polynomial t

Next Episodes



Data Skeptic

Solving the P-NP Problem @ Data Skeptic

📆 2017-11-17 01:00


Data Skeptic

P vs NP @ Data Skeptic

📆 2017-11-17 01:00


Data Skeptic

Microsoft Connect 2017 @ Data Skeptic

📆 2017-11-15 01:00