16430 search results - page 422 / 3286 » On Computable Tree Functions |
197
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
We analyse and compare the complexity of several algorithms for computing modular polynomials. We show that an algorithm relying on floating point evaluation of modular functions...
189
click to vote
STACS
2010
Springer
16 years 1 months ago
2010
Springer
The Graph Isomorphism problem restricted to graphs of bounded treewidth or bounded tree distance width are known to be solvable in polynomial time [2],[19]. We give restricted spa...
189
click to vote
CIAC
1997
Springer
15 years 11 months ago
1997
Springer
In this paper, we study the Graph Isomorphism problem on graphs of bounded treewidth, bounded degree or bounded bandwidth. Graph Isomorphism can be solved in polynomial time for g...
194
click to vote
DAC
2004
ACM
15 years 10 months ago
2004
ACM
The performance of timing-driven placement methods depends strongly on the choice of the net model. In this paper a more precise net model is presented that does not increase nume...
170
click to vote
ICALP
2009
Springer
16 years 1 months ago
2009
Springer
We consider the problem of constructing decision trees for entity identification from a given table. The input is a table containing information about a set of entities over a fi...