Sciweavers

2430 search results - page 116 / 486
» Computing Tutte Polynomials
Sort
View
SIAMDM
2010
99views more  SIAMDM 2010»
14 years 11 months ago
On the Stable Paths Problem
The Border Gateway Protocol (BGP) is the interdomain routing protocol used to exchange routing information between Autonomous Systems (ASes) in the internet today. While intradoma...
Penny E. Haxell, Gordon T. Wilfong
STACS
2010
Springer
15 years 12 months ago
Exact Covers via Determinants
Given a k-uniform hypergraph on n vertices, partitioned in k equal parts such that every hyperedge includes one vertex from each part, the k-Dimensional Matching problem asks wheth...
Andreas Björklund
DCC
2010
IEEE
14 years 12 months ago
Parameter choices and a better bound on the list size in the Guruswami-Sudan algorithm for algebraic geometry codes
Abstract. Given an algebraic geometry code CL(D, P), the GuruswamiSudan algorithm produces a list of all codewords in CL(D, P) within a specified distance of a received word. The i...
Nathan Drake, Gretchen L. Matthews
ERSHOV
2009
Springer
15 years 11 months ago
A Complete Invariant Generation Approach for P-solvable Loops
Abstract. We present an algorithm for generating all polynomial invariants of Psolvable loops with assignments and nested conditionals. We prove termination of our algorithm. The p...
Laura Kovács
156
Voted
ISSAC
2009
Springer
147views Mathematics» more  ISSAC 2009»
15 years 11 months ago
Fast algorithms for differential equations in positive characteristic
We address complexity issues for linear differential equations in characteristic p > 0: resolution and computation of the p-curvature. For these tasks, our main focus is on al...
Alin Bostan, Éric Schost