Let A3(n, d, w) denote the maximum cardinality of a ternary code with length n, minimum distance d, and constant Hamming weight w. Methods for proving upper and lower bounds on A3...
We present a framework for (static) verification of general resource usage program properties. The framework extends the criteria of correctness as the conformance of a program to ...
One of the major approaches to approximation of logical theories is the upper and lower bounds approach introduced in (Selman and Kautz, 1991, 1996). In this paper, we address the...
We investigate the maximum number of simple cycles and the maximum number of Hamiltonian cycles in a planar graph G with n vertices. Using the transfer matrix method we construct a...
Kevin Buchin, Christian Knauer, Klaus Kriegel, And...
We study the intrinsic difficulty of solving linear parabolic initial value problems numerically at a single point. We present a worst case analysis for deterministic as well as fo...