2430 search results - page 234 / 486 » Computing Tutte Polynomials |
127
click to vote
LATIN
2010
Springer
15 years 11 months ago
2010
Springer
Given a set S of segments in the plane, a polygon P is an intersecting polygon of S if every segment in S intersects the interior or the boundary of P. The problem MPIP of computi...
136
click to vote
LICS
2009
IEEE
15 years 11 months ago
2009
IEEE
In a constraint satisfaction problem (CSP) the goal is to find an assignment of a given set of variables subject to specified constraints. A global cardinality constraint is an ...
146
click to vote
COCO
2009
Springer
15 years 11 months ago
2009
Springer
This paper studies a simple class of zero-sum games played by two competing quantum players: each player sends a mixed quantum state to a referee, who performs a joint measurement...
130
click to vote
ISSAC
2009
Springer
15 years 11 months ago
2009
Springer
We study systems of higher-order linear differential equations having a regular singularity at the origin. Using the properties of matrix polynomials, we develop efficient method...
123
click to vote
ISSAC
2009
Springer
15 years 11 months ago
2009
Springer
An Artin-Schreier tower over the finite field Fp is a tower of field extensions generated by polynomials of the form Xp − X − α. Following Cantor and Couveignes, we give a...