234 search results - page 11 / 47 » Proof Nets and the Identity of Proofs |
76
Voted
TCS
2011
14 years 5 months ago
2011
CSR
2008
Springer
14 years 12 months ago
2008
Springer
We define a denotational semantics for Light Affine Logic (LAL) which has the property that denotations of functions are polynomial time computable by construction of the model. Th...
ECCC
2010
14 years 10 months ago
2010
We present an alternate proof of the result by Kabanets and Impagliazzo that derandomizing polynomial identity testing implies circuit lower bounds. Our proof is simpler, scales b...
COMBINATORICS
2000
14 years 10 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...
FCT
2007
Springer
15 years 4 months ago
2007
Springer
We give a classification of block-wise symmetric signatures in the theory of matchgate computations. The main proof technique is matchgate identities, a.k.a. useful Grassmann-Pl¨...