1379 search results - page 63 / 276 » The Complexity of the Annihilating Polynomial |
93
Voted
TC
1998
15 years 6 days ago
1998
—Let F2 denote the binary field and F 2 m an algebraic extension of degree m > 1 over F2 . Traditionally, elements of F 2 m are either represented as powers of a primitive ele...
73
Voted
IANDC
2010
14 years 11 months ago
2010
We present a polynomial-time algorithm deciding bisimilarity between a normed BPA process and a normed BPP process, with running time O(n7 ). This improves the previously known ex...
100
click to vote
VMCAI
2005
Springer
15 years 6 months ago
2005
Springer
When a system fails to satisfy its specification, the model checker produces an error trace (or counter-example) that demonstrates an undesirable behavior, which is then used in d...
115
click to vote
COCO
2004
Springer
15 years 4 months ago
2004
Springer
We initiate the study of the computational complexity of the covering radius problem for point lattices, and approximation versions of the problem for both lattices and linear cod...
134
click to vote
COCOON
2009
Springer
15 years 7 months ago
2009
Springer
We take a new look at the convex path recoloring (CPR), convex tree recoloring (CTR), and convex leaf recoloring (CLR) problems through the eyes of the independent set problem. Th...