Title of article :
The reachability problem for finite cellular automata
Author/Authors :
Andrea Clementi، نويسنده , , Russell Impagliazzo، نويسنده ,
Issue Information :
دوهفته نامه با شماره پیاپی سال 1995
Pages :
5
From page :
27
To page :
31
Keywords :
computational complexity , cellular automata , Interactive proofs , Reachability problems
Journal title :
Information Processing Letters
Serial Year :
1995
Journal title :
Information Processing Letters
Record number :
128180
Link To Document :
بازگشت