1379 search results - page 125 / 276 » The Complexity of the Annihilating Polynomial |
169
click to vote
CONCUR
2007
Springer
16 years 18 days ago
2007
Springer
We introduce strategy logic, a logic that treats strategies in two-player games as explicit first-order objects. The explicit treatment of strategies allows us to specify properti...
175
click to vote
ISSAC
2007
Springer
16 years 17 days ago
2007
Springer
We describe some major recent progress in exact and symbolic linear algebra. These advances concern the improvement of complexity estimates for fundamental problems such as linear...
157
click to vote
TLCA
2007
Springer
16 years 16 days ago
2007
Springer
Abstract. Predicative analysis of recursion schema is a method to characterize complexity classes like the class of polynomial time functions. This analysis comes from the works of...
159
click to vote
ICCV
2005
IEEE
16 years 1 days ago
2005
IEEE
We present a solution for optimal triangulation in three views. The solution is guaranteed to find the optimal solution because it computes all the stationary points of the (maxi...
183
click to vote
LICS
2005
IEEE
16 years 20 hour ago
2005
IEEE
Hierarchical graph definitions allow a modular description of graphs using modules for the specification of repeated substructures. Beside this modularity, hierarchical graph de...