APPLIED MATHEMATICS AND COMPUTATION, cilt.216, sa.2, ss.655-661, 2010 (SCI-Expanded)
In this paper, we present a new algorithm to evaluate the Kauffman bracket polynomial. The algorithm uses cyclic permutations to count the number of states obtained by the application of 'A' and 'B' type smoothings to the each crossing of the knot. We show that our algorithm can be implemented easily by computer programming. (C) 2010 Elsevier Inc. All rights reserved.