External Links

Cite Key

Statistics

  • References: 0
  • Cited by: 0
  • Reviews: 0
  • Bibliographies: 0

PDF

Researchr

Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.

Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.

Descriptive Complexity of List H-Coloring Problems in Logspace: A Refined Dichotomy

Víctor Dalmau, László Egri, Pavol Hell, Benoit Larose, Arash Rafiey. Descriptive Complexity of List H-Coloring Problems in Logspace: A Refined Dichotomy. In 30th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2015, Kyoto, Japan, July 6-10, 2015. pages 487-498, IEEE, 2015. [doi]

Authors

Víctor Dalmau

This author has not been identified. Look up 'Víctor Dalmau' in Google

László Egri

This author has not been identified. Look up 'László Egri' in Google

Pavol Hell

This author has not been identified. Look up 'Pavol Hell' in Google

Benoit Larose

This author has not been identified. Look up 'Benoit Larose' in Google

Arash Rafiey

This author has not been identified. Look up 'Arash Rafiey' in Google
runs on