Satisfiability of word equations with constants is in NEXPTIME

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 1999, Pages 721-725

  Plandowski, Wojciech ^a  

^a UNIVERSITY OF WARSAW   (Poland)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; FUNCTIONS; MATHEMATICAL TRANSFORMATIONS; PROBLEM SOLVING;

WORD EQUATIONS;

THEOREM PROVING;

EID: 0032651227     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/301250.301443     Document Type: Article

References (8)