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.

NP-completeness of the alphabetical satisfiability problem for trace equations

Luca Breveglieri, Alessandra Cherubini, Claudia Di Nucci, Emanuele Rodaro. NP-completeness of the alphabetical satisfiability problem for trace equations. In Erzsébet Csuhaj-Varjú, Zoltán Ésik, editors, Automata and Formal Languages, 12th International Conference, AFL 2008, Balatonfüred, Hungary, May 27-30, 2008, Proceedings. pages 111-121, 2008.

Authors

Luca Breveglieri

This author has not been identified. Look up 'Luca Breveglieri' in Google

Alessandra Cherubini

This author has not been identified. Look up 'Alessandra Cherubini' in Google

Claudia Di Nucci

This author has not been identified. Look up 'Claudia Di Nucci' in Google

Emanuele Rodaro

This author has not been identified. Look up 'Emanuele Rodaro' in Google
runs on