- Braid is undecidable
2014/12/02 by Linus Hamilton, Hamilton, Linus · 2 voices
Computer Science · Mathematics · #Algorithm #Artificial Intelligence in Games #Artificial intelligence #Braid #Braid group #Braid theory #Cellular Automata and Applications #Combinatorics #Computability, Logic, AI Algorithms #Computation #Computer science #DTIME #Description number #Discrete mathematics #EXPTIME #Embedding #Mathematics #NSPACE #Super-recursive algorithm #Theoretical computer science #Time hierarchy theorem #Turing machine #Undecidable problem #Universal Turing machine #cs.CC
- Approximating clique is almost NP-complete
2002/12/09 by Uriel Feige, S. Goldwasser, László Lovász +2 · 4 citations
Computer Science · Mathematics · #Advanced Graph Theory Research #Algorithm #Approximation algorithm #Chordal graph #Clique #Clique problem #Combinatorics #Complexity and Algorithms in Graphs #Computational complexity theory #Computer science #Discrete mathematics #EXPTIME #Graph #Machine Learning and Algorithms #Mathematics #Omega #PSPACE #Pathwidth #Philosophy #Treewidth
- N by N Checkers is Exptime Complete
1984/05/01 by J. M. Robson · 1 citation
Computer Science · Social Sciences · Economics, Econometrics and Finance · Mathematics · #Artificial Intelligence in Games #Digital Games and Media #Sports Analytics and Performance #Exponential function #PSPACE #Time complexity #Position (finance) #EXPTIME #Mathematics #Function (biology) #Exponential growth #Upper and lower bounds #Exponential time hypothesis #Combinatorics #Discrete mathematics #Polynomial #Computational complexity theory #Computer science #Algorithm