Satisfiability of word equations with constants is in PSPACE

Annual Symposium on Foundations of Computer Science - Proceedings

Volumn , Issue , 1999, Pages 495-500

  Plandowski, Wojciech ^a  

^a UNIVERSITY OF WARSAW   (Poland)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTABILITY AND DECIDABILITY; CONSTRAINT THEORY; ESTIMATION; POLYNOMIALS; THEOREM PROVING;

EXPONENTIAL ESTIMATION; EXPONENTIAL FUNCTIONS; INDEX OF PERIODICITY; SATISFIABILITY; WORD EQUATION;

COMPUTATIONAL COMPLEXITY;

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

References (17)