JSC 2010 - PDF Preprint Papers

JSC 2010

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed JSC-2010 Paper

click to vote

JSC
2010

155views more JSC 2010»

Algorithms for solving linear systems over cyclotomic fields

13 years 3 months ago

Download www.cecm.sfu.ca

We consider the problem of solving a linear system Ax = b over a cyclotomic ﬁeld. What makes cyclotomic ﬁelds of special interest is that we can easily ﬁnd a prime p that sp...

Liang Chen, Michael B. Monagan

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	155	Algorithms for solving linear systems over cyclotomic fields	claim
2	135	Deciding inseparability and conservative extensions in the description logic EL	claim
3	132	Binary codes from the line graph of the n-cube	claim
4	120	Theory decision by decomposition	claim
5	107	Computing automorphisms of semigroups	claim
6	107	Solving the conjugacy problem in Garside groups by cyclic sliding	claim
7	107	On the relation between Context and Sequence Unification	claim
8	106	Verifying pointer safety for programs with unknown calls	claim
9	105	Programming with narrowing: A tutorial	claim
10	103	Anti-patterns for rule-based languages	claim
11	103	Bounds on absolute positiveness of multivariate polynomials	claim
12	102	Equational approximations for tree automata completion	claim
13	100	An invariant-based approach to the verification of asynchronous parameterized networks	claim
14	99	Faster algorithms for computing Hong's bound on absolute positiveness	claim
15	96	On a generalization of Stickelberger's Theorem	claim
16	94	P versus NP and geometry	claim
17	90	An algorithm to compute Liouvillian solutions of prime order linear difference-differential equations	claim
18	90	Modular Las Vegas algorithms for polynomial absolute factorization	claim
19	86	Rational two-parameter families of spheres and rational offset surfaces	claim
20	85	On the minimum of a positive polynomial over the standard simplex	claim
21	83	Computing differential characteristic sets by change of ordering	claim
22	82	Linear complete differential resultants and the implicitization of linear DPPEs	claim
23	82	The first rational Chebyshev knots	claim
24	79	Approximate polynomial GCD: Small degree and small height perturbations	claim
25	70	Liouvillian solutions of linear difference-differential equations	claim
26	66	Special issue algebraic coding theory and applications	claim
27	64	Bounding the radii of balls meeting every connected component of semi-algebraic sets	claim
28	63	Normalization of rings	claim
29	63	A bound on the projective dimension of three cubics	claim
30	62	The invariants of the binary nonic	claim
31	62	Some new simple Lie algebras in characteristic 2	claim
32	60	On non-defectivity of certain Segre-Veronese varieties	claim
33	60	Dynamic Galois Theory	claim
34	59	Optimized parametrization of systems of incidences between rigid bodies	claim
35	58	Symbolic computation in software science: Foreword from the editor	claim
36	57	The invariants of the binary decimic	claim
37	53	Combination of convex theories: Modularity, deduction completeness, and explanation	claim
38	52	An implicitization challenge for binary factor analysis	claim
39	46	Effective bounds for P-recursive sequences	claim
40	45	Elliptic Gauss sums and applications to point counting	claim
41	42	Newton's method and FFT trading	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers