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

The rich complexity of Britain’s Jewish population
Riverdale Theory: Could Riverdale be placed in Jughead’s book?
Can we end gender bias in online algorithms?
New California law adds complexity to content moderation
Grid Shift Theory (III) – Daily Trust

Archives

November 2022
October 2022
September 2022
August 2022
July 2022
June 2022
May 2022
April 2022
March 2022
February 2022
January 2022
April 2019
January 2012

Privacy Policy
Terms and Conditions