1383 search results - page 47 / 277 » On the Complexity of the Interlace Polynomial |
113
click to vote
BIRTHDAY
2010
Springer
15 years 28 days ago
2010
Springer
The question of whether there is a logic that captures polynomial time was formulated by Yuri Gurevich in 1988. It is still wide open and regarded as one of the main open problems...
ICISC
2004
15 years 1 months ago
2004
We consider the generation of prime order elliptic curves (ECs) over a prime field Fp using the Complex Multiplication (CM) method. A crucial step of this method is to compute the ...
143
click to vote
ECCC
2011
14 years 6 months ago
2011
Polynomial identity testing (PIT) problem is known to be challenging even for constant depth arithmetic circuits. In this work, we study the complexity of two special but natural ...
112
click to vote
INFOCOM
2012
IEEE
13 years 2 months ago
2012
IEEE
—Cognitive Radio Networks allow unlicensed users to opportunistically access the licensed spectrum without causing disruptive interference to the primary users (PUs). One of the ...
IH
2005
Springer
15 years 5 months ago
2005
Springer
We examine the problem of watermarking schemes robust against geometric distortions from a complexity theoretic point of view. The main results presented are polynomial time reduct...