179 search results - page 11 / 36 » Alternation-Trading Proofs, Linear Programming, and Lower Bo... |
TAMC
2010
Springer
14 years 16 days ago
2010
Springer
We study possible formulations of algebraic propositional proof systems operating with noncommutative formulas. We observe that a simple formulation gives rise to systems at least ...
FCT
2005
Springer
14 years 1 months ago
2005
Springer
We prove optimal lower bounds for multilinear circuits and for monotone circuits with bounded depth. These lower bounds state that, in order to compute certain functions, these cir...
PAMI
2006
13 years 7 months ago
2006
A binary linear programming formulation of the graph edit distance for unweighted, undirected graphs with vertex attributes is derived and applied to a graph recognition problem. ...
POPL
2012
ACM
12 years 3 months ago
2012
ACM
Interpolation is an important technique in verification and static analysis of programs. In particular, interpolants extracted from proofs of various properties are used in invar...
DAM
1998
13 years 7 months ago
1998
We first consider so-called (1,+s)-branching programs in which along every consistent path at most s variables are tested more than once. We prove that any such program computing...