CSR 2006 - PDF Preprint Papers

CSR 2006 International Computer Science Symposium

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed CSR-2006 Paper

click to vote

CSR
2006
Springer

169views Theoretical Computer Science» more CSR 2006»

Complexity of Polynomial Multiplication over Finite Fields

13 years 8 months ago

Download www.cs.technion.ac.il

Let Mq (n ) denote the number of multiplications required to compute the coefficients of the product of two polynomials of degree n over a q -element field by means of bilinear alg...

Michael Kaminski

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status

1	169	Complexity of Polynomial Multiplication over Finite Fields	claim
2	163	Fast Motif Search in Protein Sequence Databases	claim
3	158	All Semi-local Longest Common Subsequences in Subquadratic Time	claim
4	149	Dynamic Isoline Extraction for Visualization of Streaming Data	claim
5	140	Bulk Synchronous Parallel ML: Semantics and Implementation of the Parallel Juxtaposition	claim
6	121	Constructive Equivalence Relations on Computable Probability Measures	claim
7	108	Expressiveness of Metric Modalities for Continuous Time	claim
8	104	Incremental Branching Programs	claim
9	104	Extended Resolution Proofs for Conjoining BDDs	claim
10	98	Unfolding Synthesis of Asynchronous Automata	claim
11	92	Analytic Modeling of Channel Traffic in n-Cubes	claim
12	90	Weighted Logics for Traces	claim
13	84	The Complexity of Equality Constraint Languages	claim
14	84	Inductive Type Schemas as Functors	claim
15	81	Isolation and Reducibility Properties and the Collapse Result	claim
16	80	Conjugacy and Equivalence of Weighted Automata and Functional Transducers	claim
17	80	SZK Proofs for Black-Box Group Problems	claim
18	79	Logic of Proofs for Bounded Arithmetic	claim
19	77	Synchronous Elastic Circuits	claim
20	76	Planar Dimer Tilings	claim
21	73	Non-black-box Techniques in Cryptography	claim
22	71	Window Subsequence Problems for Compressed Texts	claim
23	70	Tuples of Disjoint NP-Sets	claim
24	68	Polarized Subtyping for Sized Types	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers