- Computational Problems Related to the Design of Normal Form Relational Schemas Catriel Beeri Philip A. Bernstein Tue 29 July 2014
- Minimizing Finite Automata is Computationally Hard Andreas Malcher Thu 12 December 2013
- Minimal NFA Problems Are Hard Tao Jiang B. Ravikumar Thu 12 December 2013
- The Post correspondence problem over a unary alphabet P. Rudnicki G.J. Woeginger Sat 05 October 2013
Library Size: 13G (4 entries),
Last Updated: Apr 04, 2026, 18:14:59,
Build Time: N/A
