179 search results - page 12 / 36 » Alternation-Trading Proofs, Linear Programming, and Lower Bo... |
ICALP
2011
Springer
12 years 11 months ago
2011
Springer
Given a directed graph G = (V, E) and an integer k ≥ 1, a Steiner k-transitive-closure-spanner (Steiner k-TC-spanner) of G is a directed graph H = (VH , EH ) such that (1) V ⊆ ...
JCT
2007
13 years 7 months ago
2007
A topological graph is quasi-planar, if it does not contain three pairwise crossing edges. Agarwal et al. [2] proved that these graphs have a linear number of edges. We give a sim...
CSR
2011
Springer
12 years 11 months ago
2011
Springer
The Goldreich’s function has n binary inputs and n binary outputs. Every output depends on d inputs and is computed from them by the fixed predicate of arity d. Every Goldreich...
POPL
2009
ACM
14 years 8 months ago
2009
ACM
This paper describes an inter-procedural technique for computing symbolic bounds on the number of statements a procedure executes in terms of its scalar inputs and user-defined qu...
CPM
2010
Springer
14 years 8 days ago
2010
Springer
We study the minimum mosaic problem, an optimization problem originated in population genomics. We develop a new lower bound, called the C bound. The C bound is provably higher and...