1383 search results - page 192 / 277 » On the Complexity of the Interlace Polynomial |
209
click to vote
CORR
2011
Springer
15 years 27 days ago
2011
Springer
The complexity of the isomorphism problem for regular trees, regular linear orders, and regular words is analyzed. A tree is regular if it is isomorphic to the prefix order on a r...
234
click to vote
PAMI
2012
13 years 8 months ago
2012
— Language and image understanding are two major goals of artificial intelligence which can both be conceptually formulated in terms of parsing the input signal into a hierarchi...
179
click to vote
CANS
2007
Springer
16 years 17 days ago
2007
Springer
Abstract. In this paper we study Perfectly Secure Message Transmission (PSMT) between a sender S and a receiver R, connected in a directed synchronous network through multiple para...
199
click to vote
ATAL
2010
Springer
15 years 7 months ago
2010
Springer
We consider the computational complexity of pure Nash equilibria in graphical games. It is known that the problem is NP-complete in general, but tractable (i.e., in P) for special...
178
click to vote
PKC
2010
Springer
15 years 10 months ago
2010
Springer
Abstract. In this paper, we fully break the Algebraic Surface Cryptosystem (ASC for short) proposed at PKC’2009 [3]. This system is based on an unusual problem in multivariate cr...