On the Complexity of Semantic Self-minimization
From MaRDI portal
Publication:2810966
DOI10.1016/j.entcs.2009.08.002zbMath1339.68162MaRDI QIDQ2810966
Publication date: 6 June 2016
Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.entcs.2009.08.002
68Q25: Analysis of algorithms and problem complexity
03B70: Logic in computer science
68Q60: Specification and verification (program logics, model checking, etc.)
Related Items
EXPTIME-complete Decision Problems for Modal and Mixed Specifications, Modal and mixed specifications: key decision problems and their complexities
Cites Work
- Results on the propositional \(\mu\)-calculus
- The complexity of facets (and some facets of complexity)
- The complexity of facets resolved
- Complexity of Decision Problems for Mixed and Modal Specifications
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item