"NP-completeness of the alphabetical satisfiability problem for trace ..."

Luca Breveglieri et al. (2008)

> Home

Details and statistics

DOI: —

access: unavailable

type: Conference or Workshop Paper

metadata version: 2011-11-18

- no documents available
- export record
  dblp key:
  - conf/afl/BreveglieriCNR08
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/afl/BreveglieriCNR08
Luca Breveglieri, Alessandra Cherubini, Claudia Di Nucci, Emanuele Rodaro:
NP-completeness of the alphabetical satisfiability problem for trace equations. AFL 2008: 111-121

a service of

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.