The complexity of temporal constraint satisfaction problems

  • Authors:
  • Manuel Bodirsky;Jan Kara

  • Affiliations:
  • Ecole polytechnique, Palaiseau, France;Faculty of Mathematics and Physics, Charles University, Prague, Czech Rep

  • Venue:
  • STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

A temporal constraint language is a set of relations that has a first-order definition in (b Q,