Complexity of Makanin's algorithm
Journal of the ACM (JACM)
Makanin's algorithm is not primitive recursive
Theoretical Computer Science
Satisfiability of word equations with constants is in NEXPTIME
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Studying Algorithmic Problems for Free Semi-groups and Groups
LFCS '97 Proceedings of the 4th International Symposium on Logical Foundations of Computer Science
Application of Lempel-Ziv Encodings to the Solution of Words Equations
ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
Equations in Free Semigroups with Anti-involution and Their Relation to Equations in Free Groups
LATIN '00 Proceedings of the 4th Latin American Symposium on Theoretical Informatics
The Security of Individual RSA Bits
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Satisfiability of Word Equations with Constants is in PSPACE
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
On Mixing Deduction and Substitution in Lambek Categorial Grammars
LACL '01 Proceedings of the 4th International Conference on Logical Aspects of Computational Linguistics
Solvability of Equations in Free Partially Commutative Groups Is Decidable
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
The Existential Theory of Equations with Rational Constraints in Free Groups is PSPACE-Complete
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
Existential and Positive Theories of Equations in Graph Products
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
Equations in free semigroups with involution and their relation to equations in free groups
Theoretical Computer Science - Latin American theoretical informatics
The existential theory of equations with rational constraints in free groups is PSPACE-complete
Information and Computation
The existential theory of equations with rational constraints in free groups is PSPACE-complete
Information and Computation
A word equation solver based on Levensthein distance
MICAI'07 Proceedings of the artificial intelligence 6th Mexican international conference on Advances in artificial intelligence
| Hi-index | 0.00 |