534 search results - page 46 / 107 » Proving Termination of Rewrite Systems Using Bounds |
STOC
2005
ACM
14 years 8 months ago
2005
ACM
We prove exponential lower bounds for the refutation of a random 3-CNF with linear number of clauses by k-DNF Resolution for k log n/ log log n. For this we design a specially ta...
SPAA
2009
ACM
14 years 2 months ago
2009
ACM
We consider bit communication complexity of binary consensus in synchronous message passing systems with processes prone to crashes. A distributed algorithm is locally scalable wh...
JLP
2010
13 years 2 months ago
2010
K is an executable semantic framework in which programming languages, calculi, as well as type systems or formal analysis tools can be defined making use of configurations, comput...
AUTOMATICA
2005
13 years 7 months ago
2005
This paper proposes a quadratic programming (QP) approach to robust model predictive control (MPC) for constrained linear systems having both model uncertainties and bounded distu...
CRYPTO
2011
Springer
12 years 7 months ago
2011
Springer
Strong lattice reduction is the key element for most attacks against lattice-based cryptosystems. Between the strongest but impractical HKZ reduction and the weak but fast LLL redu...