Search the dblp DataBase

Publications of Author

1. Ondrej Klíma
   Unification Modulo Associativity and Idempotency Is NP-complete. [Citation Graph (0, 0)][DBLP]
   MFCS, 2002, pp:423-432 [Conf]
   
2. Ondrej Klíma, Benoit Larose, Pascal Tesson
   Systems of Equations over Finite Semigroups and the #CSP Dichotomy Conjecture. [Citation Graph (0, 0)][DBLP]
   MFCS, 2006, pp:584-595 [Conf]
   
3. Ondrej Klíma, Jirí Srba
   Matching Modulo Associativity and Idempotency Is NP-Complete. [Citation Graph (0, 0)][DBLP]
   MFCS, 2000, pp:456-466 [Conf]
   
4. Ivana Cerná, Ondrej Klíma, Jirí Srba
   Pattern Equations and Equations with Stuttering. [Citation Graph (0, 0)][DBLP]
   SOFSEM, 1999, pp:369-378 [Conf]
   
5. Ondrej Klíma, Pascal Tesson, Denis Thérien
   Dichotomies in the Complexity of Solving Systems of Equations over Finite Semigroups [Citation Graph (0, 0)][DBLP]
   Electronic Colloquium on Computational Complexity (ECCC), 2004, v:, n:091, pp:- [Journal]
   
6. Ondrej Klíma, Pascal Tesson, Denis Thérien
   Dichotomies in the Complexity of Solving Systems of Equations over Finite Semigroups. [Citation Graph (0, 0)][DBLP]
   Theory Comput. Syst., 2007, v:40, n:3, pp:263-297 [Journal]
   
7. 
   Hierarchies of Piecewise Testable Languages. [Citation Graph (, )][DBLP]
   
   
8. 
   On Schützenberger Products of Semirings. [Citation Graph (, )][DBLP]
   
   
9. 
   Polynomial Operators on Classes of Regular Languages. [Citation Graph (, )][DBLP]
   
   
10. 
    Literal Varieties of Languages Induced by Homomorphisms onto Nilpotent Groups. [Citation Graph (, )][DBLP]
    
    
11. 
    Descriptional Complexity of the Languages KaL: Automata, Monoids and Varieties [Citation Graph (, )][DBLP]