Title of article
Ground reducibility is EXPTIME-complete
Author/Authors
Hubert Comon، نويسنده , , Florent Jacquemard، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2003
Pages
31
From page
123
To page
153
Keywords
Tree automata , computational complexity , Rewriting systems , Computer theorem-proving
Journal title
Information and Computation
Serial Year
2003
Journal title
Information and Computation
Record number
262194
Link To Document