2430 search results - page 79 / 486 » Computing Tutte Polynomials |
127
click to vote
JALC
2006
15 years 6 months ago
2006
In this paper we present an extension of Dolev-Yao models for security protocols with a notion of random polynomial-time (Las Vegas) computability. First we notice that Dolev-Yao ...
141
click to vote
MICS
2007
15 years 5 months ago
2007
An alternative to Lagrange inversion for solving analytic systems is our technique of dual vector fields. We implement this approach using matrix multiplication that provides a f...
109
click to vote
GD
2004
Springer
15 years 11 months ago
2004
Springer
We prove that the number of distinct weaving patterns produced by n semi-algebraic curves in R3 defined coordinate-wise by polynomials of degrees bounded by some constant d, is b...
150
click to vote
STOC
1991
ACM
15 years 9 months ago
1991
ACM
The study of self-testing/correcting programs was introduced in [8] in order to allow one to use program P to compute function f without trusting that P works correctly. A self-te...
153
click to vote
ACL
2000
15 years 7 months ago
2000
Dominance constraints are logical descriptions of trees that are widely used in computational linguistics. Their general satisfiability problem is known to be NP-complete. Here we...