1199 search results - page 27 / 240 » Parameterized Proof Complexity |
CIE
2010
Springer
14 years 1 months ago
2010
Springer
In this note, we use lower bounds on Boolean multiplicative complexity to prove lower bounds on Boolean circuit complexity. We give a very simple proof of a 7n/3 − c lower bound ...
RTA
2010
Springer
14 years 16 days ago
2010
Springer
Abstract. In this paper we introduce a modular framework which allows to infer (feasible) upper bounds on the (derivational) complexity of term rewrite systems by combining differ...
FM
2003
Springer
14 years 1 months ago
2003
Springer
As the systems we have to specify and verify become larger and more complex, there is a mounting need to combine different tools and decision procedures to accomplish large proof ...
TCS
2011
13 years 3 months ago
2011
New, simple, proofs of soundness (every representable function lies in a given complexity class) for Elementary Affine Logic, LFPL and Soft Affine Logic are presented. The proofs ...
MST
2007
13 years 8 months ago
2007
In 1996, Khanna and Motwani [KM96] proposed three logic-based optimization problems constrained by planar structure, and offered the hypothesis that these putatively fundamental ...