1383 search results - page 44 / 277 » On the Complexity of the Interlace Polynomial |
FOCS
1990
IEEE
15 years 3 months ago
1990
IEEE
In [Sh92], Adi Shamir proved a complete characterization of the complexity class IP. He showed that when both randomization and interaction are allowed, the proofs that can be ver...
MOC
2010
14 years 6 months ago
2010
We find a system of two polynomial equations in two unknowns, whose solution allows us to give an explicit expression of the conformal representation of a simply connected three-sh...
TCS
2010
14 years 6 months ago
2010
We describe a solution to the SAT problem via non-confluent P systems with active membranes, without using membrane division rules. Furthermore, we provide an algorithm for simula...
CORR
1999
Springer
14 years 11 months ago
1999
Springer
It is known that for any class C closed under union and intersection, the Boolean closure of C, the Boolean hierarchy over C, and the symmetric difference hierarchy over C all are ...
113
click to vote
JOC
2010
14 years 6 months ago
2010
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 ...