Satisfiability of word equations with constants is in exponential space

Annual Symposium on Foundations of Computer Science - Proceedings

Volumn , Issue , 1998, Pages 112-119

  Gutierrez, Claudio ^a  

^a WESLEYAN UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; PROBLEM SOLVING;

EXPONENTIAL SPACE; MAKANIN'S ALGORITHM; WORD EQUATIONS;

COMPUTER SCIENCE;

EID: 0032314322     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (19)