1204 search results - page 68 / 241 » Termination of Polynomial Programs |
96
Voted
ICALP
2005
Springer
15 years 6 months ago
2005
Springer
Abstract. We describe a cryptographically sound formal logic for proving protocol security properties without explicitly reasoning about probability, asymptotic complexity, or the ...
99
Voted
CSREASAM
2006
15 years 2 months ago
2006
- Thanks to the spread of mobile technologies, we can access to the network anytime and from anywhere. In the near future, we will enable to realize the ubiquitous computing enviro...
92
Voted
AAAI
2004
15 years 2 months ago
2004
An odd cycle of a logic program is a simple cycle that has an odd number of negative edges in the dependency graph of the program. Similarly, an even cycle is one that has an even...
STOC
2006
ACM
16 years 28 days ago
2006
ACM
We present the first randomized polynomial-time simplex algorithm for linear programming. Like the other known polynomial-time algorithms for linear programming, its running time ...
107
click to vote
AUTOMATICA
2008
15 years 22 days ago
2008
A wide variety of stability and performance questions about linear dynamical systems can be reformulated as convex optimization problems involving linear matrix inequalities (LMIs...