|
Volumn 34, Issue 6, 2000, Pages 467-501
|
Two-variable word equations
|
Author keywords
Complexity function; Expressible language; Minimal solution; Solvability; Word equation
|
Indexed keywords
ALGORITHMIC LANGUAGES;
BOUNDARY CONDITIONS;
COMPUTATIONAL COMPLEXITY;
FUNCTIONS;
GRAPH THEORY;
LINEAR EQUATIONS;
LINEARIZATION;
OPTIMIZATION;
PARAMETER ESTIMATION;
SET THEORY;
THEOREM PROVING;
CHARATONIK ALGORITHM;
CONSTANT COMPLEXITY;
DIOPHANTINE EQUATIONS;
EXPONENTIAL COMPLEXITY;
LINEAR COMPLEXITY;
LINEAR UPPER BOUNDS;
OPTIMAL UPPER BOUNDS;
PACHOLSKI ALGORITHM;
TWO VARIABLE WORD EQUATIONS;
INFORMATION THEORY;
|
EID: 17844381851
PISSN: 09883754
EISSN: 28047346
Source Type: Journal
DOI: 10.1051/ita:2000126 Document Type: Article |
Times cited : (21)
|
References (16)
|