535 search results - page 52 / 107 » Checking Computations in Polylogarithmic Time |
AI
2007
Springer
13 years 9 months ago
2007
Springer
We present an efficient algorithm that checks the consistency of partial descriptions of ordered trees. The constraint language of these descriptions was introduced by Cornell in c...
ASIAN
2007
Springer
14 years 3 months ago
2007
Springer
Abstract. We present a logic-based framework to evaluate the resilience of computer networks in the face of incidents, i.e., attacks from malicious intruders as well as random faul...
SAC
2006
ACM
14 years 3 months ago
2006
ACM
Parameterization is an effective technique for building flexible, reusable software. When dealing with parameterized components, an important concern is the time at which parame...
CONCUR
2006
Springer
14 years 22 days ago
2006
Springer
We describe an incomplete but sound and efficient livelock freedom test for infinite state asynchronous reactive systems. The method s a system into a set of simple control flow cy...
FOCS
1998
IEEE
14 years 1 months ago
1998
IEEE
The properties of any system of k simultaneous equations in n variables over GF(q), are studied, with a particular emphasis on unsatisfiable systems. A general formula for the num...