2430 search results - page 208 / 486 » Computing Tutte Polynomials |
124
click to vote
CSR
2008
Springer
15 years 6 months ago
2008
Springer
We define a denotational semantics for Light Affine Logic (LAL) which has the property that denotations of functions are polynomial time computable by construction of the model. Th...
139
click to vote
ENDM
2006
15 years 4 months ago
2006
Many classes of graphs where the vertex coloring problem is polynomially solvable are known, the most prominent being the class of perfect graphs. However, the list-coloring proble...
121
click to vote
COMPUTING
2007
15 years 4 months ago
2007
In this paper we introduce construction algorithms for Korobov rules for numerical integration which work well for a given set of dimensions simultaneously. The existence of such ...
105
click to vote
ICASSP
2011
IEEE
14 years 8 months ago
2011
IEEE
This paper presents computationally efficient implementations for Iterative Adaptive Approach (IAA) spectral estimation techniques for uniformly sampled data sets. By exploiting ...
140
click to vote
FOCS
2007
IEEE
15 years 10 months ago
2007
IEEE
We design a randomized polynomial time algorithm which, given a 3-tensor of real numbers A = {aijk}n i,j,k=1 such that for all i, j, k ∈ {1, . . . , n} we have ai jk = aik j = a...