Sciweavers

2430 search results - page 22 / 486

» Computing Tutte Polynomials

105

COCO
2005
Springer

89views Algorithms» more COCO 2005»

Computationally Private Randomizing Polynomials and Their Applications

15 years 11 months ago

Computationally Private Randomizing Polynomials and Their Applications

Download www.cs.technion.ac.il

Benny Applebaum, Yuval Ishai, Eyal Kushilevitz

claim paper

Read More »

103

ISSAC
2005
Springer

71views Mathematics» more ISSAC 2005»

Efficient computation of the characteristic polynomial

15 years 11 months ago

Efficient computation of the characteristic polynomial

Download ljk.imag.fr

Jean-Guillaume Dumas, Clément Pernet, Zhend...

claim paper

Read More »

143

CRYPTO
2004
Springer

145views Cryptology» more CRYPTO 2004»

Computing the RSA Secret Key Is Deterministic Polynomial Time Equivalent to Factoring

15 years 11 months ago

Computing the RSA Secret Key Is Deterministic Polynomial Time Equivalent to Factoring

Download cseweb.ucsd.edu

Alexander May

claim paper

Read More »

131

ISSAC
2000
Springer

103views Mathematics» more ISSAC 2000»

Computing the Galois group of a polynomial using linear differential equations

15 years 9 months ago

Computing the Galois group of a polynomial using linear differential equations

Download perso.univ-rennes1.fr

Olivier Cormier, Michael F. Singer, Felix Ulmer

claim paper

Read More »

137

ACL
2008

124views Computational Linguistics» more ACL 2008»

splitSVM: Fast, Space-Efficient, non-Heuristic, Polynomial Kernel Computation for NLP Applications

15 years 7 months ago

splitSVM: Fast, Space-Efficient, non-Heuristic, Polynomial Kernel Computation for NLP Applications

Download www.cs.bgu.ac.il

Yoav Goldberg, Michael Elhadad

claim paper

Read More »

« Prev « First page 22 / 486 Last » Next »