The complexity of temporal constraint satisfaction problems - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

Manuel Bodirsky, Jan Kára. The complexity of temporal constraint satisfaction problems. In Richard E. Ladner, Cynthia Dwork, editors, Proceedings of the 40th Annual ACM Symposium on Theory of Computing, Victoria, British Columbia, Canada, May 17-20, 2008. pages 29-38, ACM, 2008. [doi]

This author has not been identified. Look up 'Manuel Bodirsky' in GoogleThis author has not been identified. Look up 'Jan Kára' in Google

runs on WebDSL