2015/03/30 by Bodirsky, Manuel, Martin, Barnaby, Mottet, Antoine
#03C99 #Computational Complexity (cs.CC) #F.4.1 #FOS: Computer and information sciences #FOS: Mathematics #Logic (math.LO)
paper · doi:10.48550/arxiv.1503.08572
A discrete temporal constraint satisfaction problem is a constraint satisfaction problem (CSP) whose constraint language consists of relations that are first-order definable over (\Bbb Z,