TrackMania is NP-complete
Computational Complexity
2014-11-24 v1
Authors:
Franck Dernoncourt
Abstract
We prove that completing an untimed, unbounded track in TrackMania Nations Forever is NP-complete by using a reduction from 3-SAT and showing that a solution can be checked in polynomial time.
Cite
@article{arxiv.1411.5765,
title = {TrackMania is NP-complete},
author = {Franck Dernoncourt},
journal= {arXiv preprint arXiv:1411.5765},
year = {2014}
}
Related papers
View all related →
Data Structures and Algorithms · Computer Science
A Polynomial time Algorithm for 3SAT
Lizhi Du
2026-04-23
Data Structures and Algorithms · Computer Science
A new algorithm for Solving 3-CNF-SAT problem
Belal Qasemi
2017-04-07
Computational Complexity · Computer Science
Algorithm that Solves 3-SAT in Polynomial Time
Jason W. Steinmetz
2015-06-04
Computational Complexity · Computer Science
Method of resolution of 3SAT in polynomial time
Luigi Salemi
2010-09-14
Computational Complexity · Computer Science
All instances of MONOTONE 3-SAT-(3,1) are satisfiable
Hannah Van Santvliet, Ronald de Haan
2023-12-11
Computational Complexity · Computer Science
A Polynomial Time Algorithm for 3SAT
Robert Quigley
2024-06-14
Computational Complexity · Computer Science
On the Tractability of Un/Satisfiability
Latif Salum
2020-04-08
Computational Complexity · Computer Science
A Critique of Du's "A Polynomial-Time Algorithm for 3-SAT
Yumeng He, Matan Kotler-Berkowitz, Harry Liuson, Zeyu Nie
2024-04-09
Combinatorics · Mathematics
Pattern Matching in Set Partitions is NP-Complete
Thomas Grubb
2020-09-02
Computational Complexity · Computer Science
A Critique of Quigley's "A Polynomial Time Algorithm for 3SAT"
Nicholas DeJesse, Spencer Lyudovyk, Dhruv Pai
2025-10-28
Computational Complexity · Computer Science
On a variant of Monotone NAE-3SAT and the Triangle-Free Cut problem
Peiyush Jain
2010-03-30
Data Structures and Algorithms · Computer Science
Determining satisfiability of 3-SAT in polynomial time
Ortho Flint, Asanka Wickramasinghe, Jason Brasse, Christopher Fowler
2020-07-02
Computational Complexity · Computer Science
On Salum's Algorithm for $\mathrm{X3SAT}$
Arian Nadjimzadah, David E. Narváez
2021-04-08
Computational Complexity · Computer Science
On simplified NP-complete variants of Not-All-Equal 3-Sat and 3-Sat
Andreas Darmann, Janosch Döcker
2019-08-27
Computational Complexity · Computer Science
NP-Completeness of deciding the feasibility of Linear Equations over binary-variables with coefficients and constants that are 0, 1, or -1
Deepak Ponvel Chermakani
2012-10-23
Number Theory · Mathematics
Near NP-Completeness for Detecting p-adic Rational Roots in One Variable
Martin Avendano, Ashraf Ibrahim, J. Maurice Rojas, Korben Rusek
2010-11-09
Computational Complexity · Computer Science
Minimal TSP Tour is coNP-Complete
Marzio De Biasi
2014-03-24
Computational Complexity · Computer Science
A modification of the CSP algorithm for infinite languages
Dmitriy Zhuk
2019-03-07
Computational Complexity · Computer Science
Implementation of Polynomial NP-Complete Algorithms Based on the NP Verifier Simulation Framework
Changryeol Lee
2026-04-30
Computational Complexity · Computer Science
Finding hardness reductions automatically using SAT solvers
Helena Bergold, Manfred Scheucher, Felix Schröder
2024-02-12
Quantum Physics · Physics
NP problem in quantum algorithm
Masanori Ohya, Natsuki Masuda
2008-11-26
Computational Complexity · Computer Science
Monotone 3-Sat-(2,2) is NP-complete
Janosch Döcker
2019-12-18
Computational Complexity · Computer Science
NP-complete variants of some classical graph problems
Per Alexandersson
2020-01-14
Data Structures and Algorithms · Computer Science
Improved Algorithms for 3-Coloring, 3-Edge-Coloring, and Constraint Satisfaction
David Eppstein
2007-05-23
Computational Complexity · Computer Science
Augmenting a Geometric Matching is $NP$-complete
Tillmann Miltzow
2012-06-28