Inapproximability of nondeterministic state and transition complexity assuming P ≠ NP

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4588 LNCS, Issue , 2007, Pages 205-216

  Gruber, Hermann ^a   Holzer, Markus ^b  

^a UNIVERSITY OF MUNICH   (Germany)

^b TECHNICAL UNIVERSITY OF MUNICH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; BINARY DECISION DIAGRAMS; COMPUTATIONAL COMPLEXITY; CRYPTOGRAPHY; PROBLEM SOLVING;

BICLIQUE EDGE COVER PROBLEM; DETERMINISTIC FINITE AUTOMATON; FINITE LANGUAGES;

FINITE AUTOMATA;

EID: 34548067201     PISSN: 03029743     EISSN: 16113349     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-73208-2_21     Document Type: Conference Paper

References (14)

1. Amilhastre, J., Janssen, P., Vilarem, M.-C.: FA minimisation heuristics for a class of finite languages. In: Boldt, O., Jürgensen, H. (eds.) WIA 1999. LNCS, vol. 2214, pp. 1-12. Springer, Heidelberg (2001)
2. Champarnaud, J.-M., Pin, J.-E.: A maxmin problem on finite automata. Discrete Applied Mathematics 23, 91-96 (1989)
3. Garey, M.R., Johnson, D.S.: Computers and Intractability, A Guide to the Theory of NP-Completeness. Freeman, San Francisco (1979)
4. Gramlich, G., Schnitger, G.: Minimizing NFA's and regular expressions. In: Diekert, V., Durand, B. (eds.) STACS 2005. LNCS, vol. 3404, pp. 399-411. Springer, Heidelberg (2005)
5. Gruber, H., Holzer, M.: Finding lower bounds for nondeterministic state complexity is hard (extended abstract). In: Ibarra, O.H., Dang, Z. (eds.) DLT 2006. LNCS, vol. 4036, pp. 363-374. Springer, Heidelberg (2006)
6. Gruber, H., Holzer, M.: On the average state and transition complexity of finite languages. Theoretical Computer Science, Special Issue: Selected papers of Descriptional Complexity of Formal Systems, Accepted for publication (2006)
7. Gruber, H., Holzer, M.: Computational complexity of NFA minimization for finite and unary languages. In: Proceedings of the 1st International Conference on Language and Automata Theory and Applications, Tarragona, Spain, LNCS, Springer. Accepted for publication (March 2007)
8. Jiang, T., Ravikumar, B.: Minimal NFA problems are hard. SIAM Journal on Computing 22(6), 1117-1141 (1993)
9. Kann, V.: Polynomially bounded minimization problems that are hard to approximate. Nordic Journal of Computing 1(3), 317-331 (1994)
10. Orlin, J.: Contentment in graph theory: Covering graphs with cliques. Indagationes Mathematicae 80, 406-424 (1977)
11. Simon, H.U.: On approximate solutions for combinatorial optimization problems. SIAM Journal on Discrete Mathematics 3(2), 294-310 (1990)
12. Vazirani, V.V.: Approximation Algorithms. Springer, Heidelberg (2001)
13. Yu, S.: Regular languages. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, vol. 1, pp. 41-110. Springer, Heidelberg (1997)
14. Zuckerman, D.: Linear degree extractors and the inapproximability of max clique and chromatic number. Report Report-100, Electronic Colloquium on Computational Complexity (ECCC) (September 2005)