2446 search results - page 101 / 490 » Choiceless Polynomial Time |
103
Voted
CORR
2006
Springer
15 years 22 days ago
2006
Springer
This paper brings together two lines of research: implicit characterization of complexity classes by Linear Logic (LL) on the one hand, and computation over an arbitrary ring in t...
99
Voted
IJNSEC
2008
15 years 21 days ago
2008
In1985, Shmuley proposed a theorem about intractability of Composite Diffie-Hellman. The theorem of Shmuley may be paraphrased as saying that if there exist a probabilistic polyno...
77
Voted
JLP
2008
15 years 20 days ago
2008
A formulation of na
65
Voted
SIAMDM
2008
15 years 18 days ago
2008
In a recent paper, Dur
67
Voted
TCS
2002
15 years 10 days ago
2002
We define a coding of natural numbers