2430 search results - page 137 / 486 » Computing Tutte Polynomials |
139
click to vote
FSTTCS
2010
Springer
15 years 2 months ago
2010
Springer
A fundamental problem in numerical computation and computational geometry is to determine the sign of arithmetic expressions in radicals. Here we consider the simpler problem of d...
162
click to vote
TARK
2009
Springer
15 years 11 months ago
2009
Springer
The logical omniscience feature assumes that an epistemic agent knows all logical consequences of her assumptions. This paper offers a general theoretical framework that views log...
138
click to vote
CSFW
2007
IEEE
15 years 11 months ago
2007
IEEE
We present a new mechanized prover for showing correspondence assertions for cryptographic protocols in the computational model. Correspondence assertions are useful in particular...
144
click to vote
SP
2006
IEEE
15 years 11 months ago
2006
IEEE
We present a new mechanized prover for secrecy properties of security protocols. In contrast to most previous provers, our tool does not rely on the Dolev-Yao model, but on the co...
134
click to vote
SIGECOM
2004
ACM
15 years 10 months ago
2004
ACM
We provide efficient algorithms for finding approximate BayesNash equilibria (BNE) in graphical, specifically tree, games of incomplete information. In such games an agent’s p...