Login / Signup
The Context-Freeness Problem Is coNP-Complete for Flat Counter Systems.
Jérôme Leroux
Vincent Penelle
Grégoire Sutre
Published in:
ATVA (2014)
Keyphrases
</>
np complete
data sets
artificial intelligence
data sources
satisfiability problem