Skip to content

Home
Parameterized complexity
Exact computation
Parameterized algorithms
Complexity theory

Home
2012
January

Month: January 2012

Complexity theory

Pac-Man Proved NP-Hard by Computational Complexity Theory

Sharon D. Cole
January 26, 2012

Categories

Complexity theory
Exact computation
Parameterized algorithms
Parameterized complexity

artificial intelligence critical race decision making high school intelligence ai long term long time machine learning pop culture race theory real time real world star wars united states vice president

Recent Posts

FTC orders company to remove algorithms created with data alleged to have been improperly obtained | Akin Gump Strauss Hauer & Feld LLP
Sunak’s windfall tax comes with added complexity
What you need to know about the Dow Theory
How Social Media Algorithms Manipulate What You Read
Businesses grapple with security and operational complexity in hybrid cloud environments

Archives

May 2022
April 2022
March 2022
February 2022
January 2022
January 2012

Privacy Policy
Terms and Conditions