The following pages link to Sei'ichi Tani (Q1356503):
Displaying 18 items.
- (Q741748) (redirect page) (← links)
- Computing HOMFLY polynomials of 2-bridge links from 4-plat representation (Q741749) (← links)
- (Q1022581) (redirect page) (← links)
- Fast algorithms for computing Jones polynomials of certain links (Q1022582) (← links)
- VC-dimensions of finite automata and commutative finite automata with \(k\) letters and \(n\) states (Q1356504) (← links)
- (Q2921690) (← links)
- (Q3126928) (← links)
- (Q3619683) (← links)
- (Q4253326) (← links)
- (Q4267820) (← links)
- (Q4505396) (← links)
- DEGREES OF THE JONES POLYNOMIALS OF CERTAIN PRETZEL LINKS (Q4541152) (← links)
- (Q4705516) (← links)
- (Q4935139) (← links)
- A CHARACTERIZATION OF k-TH POWERS P<sub>n,k</sub> OF PATHS IN TERMS OF k-TREES (Q5249270) (← links)
- VC-dimensions of finite automata and commutative finite automata with \(k\) letters and \(n\) states (Q5967074) (← links)
- The computational complexity of classical knot recognition (Q6181209) (← links)
- Learning of restricted RNLC graph languages (Q6487959) (← links)
