29 search results - page 6 / 6 » Separation results for the size of constant-depth propositio... |
VMCAI
2010
Springer
14 years 2 months ago
2010
Springer
Abstract. Techniques such as verification condition generation, preditraction, and expressive type systems reduce software verification to proving formulas in expressive logics. Pr...
CJTCS
1999
13 years 5 months ago
1999
We show that thepermanent cannot be computed by uniform constantdepth threshold circuits of size Tn, for any function T such that for all k, Tk n = o2n. More generally, we show th...
JCT
2010
13 years 3 months ago
2010
In the symmetric group on a set of size 2n, let P2n denote the conjugacy class of involutions with no fixed points (equivalently, we refer to these as “pairings”, since each ...
CP
2000
Springer
13 years 9 months ago
2000
Springer
We are interested in the expressiveness of constraints represented by general first order formulae, with equality as unique relation symbol and function symbols taken from an infi...