18 citations · 28 across the 25 of their papers we have counts for
Showing 2009Show all
2 papers · 1 filter
cs.FL2009
On Descriptional Complexity of the Planarity Problem for Gauss Words
Vitaliy Kurlin, Alexei Lisitsa, Igor Potapov +1
In this paper we investigate the descriptional complexity of knot theoretic problems and show upper bounds for planarity problem of signed and unsigned knot diagrams represented by…
math.GR2009
The Identity Correspondence Problem and its Applications
Paul C. Bell, Igor Potapov
In this paper we study several closely related fundamental problems for words and matrices. First, we introduce the Identity Correspondence Problem (ICP): whether a finite set of p…