Login / Signup
If Space-Time Is Discrete, It Could Be Possible to Solve NP-Complete Problems in Polynomial Time.
Ricardo Alvarez
Nick Sims
Christian Servin
Martine Ceberio
Vladik Kreinovich
Published in:
Int. J. Unconv. Comput. (2020)
Keyphrases
</>
space time
np complete problems
spatio temporal
spatial and temporal
video sequences
dynamic scenes
np complete
graph coloring
computational complexity
phase transition
multiple view geometry
scan statistic
machine learning
temporal information
hard problems
job shop scheduling
data structure
objective function