1302 search results - page 29 / 261 » Free-Style Theorem Proving |
ECCC
2010
13 years 6 months ago
2010
Bodlaender’s Theorem states that for every k there is a linear-time algorithm that decides whether an input graph has tree width k and, if so, computes a width-k tree compositio...
DCG
2000
13 years 7 months ago
2000
Points P1, . . . , Pn in the unit square define a convex n-chain if they are below y = x and, together with P0 = (0, 0) and Pn+1 = (1, 1), they are in convex position. Under unifo...
JAR
2010
13 years 6 months ago
2010
Many theorems involving special functions such as ln, exp and sin can be proved automatically by MetiTarski: a resolution theorem prover modified to call a decision procedure for ...
COMBINATORICS
2000
13 years 7 months ago
2000
Recently Zagier proved a remarkable q-series identity. We show that this identity can also be proved by modifying Franklin's classical proof of Euler's pentagonal number...
CDC
2010
IEEE
13 years 2 months ago
2010
IEEE
This paper addresses the problem of establishing stability of interconnections of integral input-to-state stable (iISS) systems. Recently, the small-gain theorem for input-tostate ...