2446 search results - page 76 / 490 » Choiceless Polynomial Time |
MOC
2002
13 years 7 months ago
2002
This paper presents an average time analysis of a Hensel lifting based factorisation algorithm for bivariate polynomials over finite fields. It is shown that the average running ti...
JMLR
2006
13 years 7 months ago
2006
We describe polynomial
MFCS
2004
Springer
14 years 1 months ago
2004
Springer
Let G = (V, E) be a (directed) graph with vertex set V and edge (arc) set E. Given a set P of (source-sink) pairs of vertices of G, an important problem that arises in the computat...
IWPEC
2004
Springer
14 years 1 months ago
2004
Springer
We propose to look at the computational complexity of 2-dimensional geometric optimization problems on a finite point set with respect to the number of inner points (that is, poi...
DLT
2010
13 years 9 months ago
2010
Abstract. It is shown that for graph groups (right-angled Artin groups) the conjugacy problem as well as a restricted version of the simultaneous conjugacy problem can be solved in...