Similar Items: Universal First-Order Logic is Superfluous for NL, P, NP and coNP
- Minimization of visibly pushdown automata is NP-complete
- Deciding DFA-Primality is NP-Hard
- Optimal Union Probability Interval Is NP-Hard
- Assessing the pharmacokinetic profile of the CamMedNP natural products database: an approach
- Maximum Solow--Polasky Diversity Subset Selection Is NP-hard Even in the Euclidean Plane
- A first-order logic characterization of safety and co-safety languages