2430 search results - page 259 / 486 » Computing Tutte Polynomials |
132
click to vote
CC
2005
Springer
15 years 4 months ago
2005
Springer
We study the complexity of constructing pseudorandom generators (PRGs) from hard functions, focussing on constant-depth circuits. We show that, starting from a function f : {0, 1}l...
142
click to vote
MOC
2002
15 years 3 months ago
2002
The spectral method with discrete spherical harmonics transform plays an important role in many applications. In spite of its advantages, the spherical harmonics transform has a dr...
152
click to vote
SPIN
2010
Springer
15 years 2 months ago
2010
Springer
Abstract. We develop an algorithm to compute timed reachability probabilities for distributed models which are both probabilistic and nondeterministic. To obtain realistic results ...
151
click to vote
WALCOM
2010
IEEE
15 years 2 months ago
2010
IEEE
Treewidth and pathwidth are important graph parameters that represent how close the graph is to trees and paths respectively. We calculate treewidth and pathwidth on parameterized ...
158
click to vote
COMMA
2010
14 years 11 months ago
2010
In this paper we define a recursive semantics for warrant in a general defeasible argumentation framework by formalizing a notion of collective (non-binary) conflict among argumen...