- Reachability in two-clock timed automata is PSPACE-complete John Fearnley Marcin Jurdziński Mon 09 November 2015
- Inclusion Dependencies and Their Interaction with Functional Dependencies Marco A. Casanova Ronald Fagin Christos H. Papadimitriou Tue 29 July 2014
- Minimal NFA Problems Are Hard Tao Jiang B. Ravikumar Thu 12 December 2013
Library Size: 13G (3 entries),
Last Updated: Apr 04, 2026, 18:14:59,
Build Time: N/A
