281 search results - page 10 / 57 » The Proof Complexity of Linear Algebra |
NIPS
2008
13 years 9 months ago
2008
This work characterizes the generalization ability of algorithms whose predictions are linear in the input vector. To this end, we provide sharp bounds for Rademacher and Gaussian...
ICTCS
2003
Springer
14 years 1 months ago
2003
Springer
Abstract. Given two proofs in a logical system with a confluent cutelimination procedure, the cut-elimination problem (CEP) is to decide whether these proofs reduce to the same no...
CRYPTO
2008
Springer
13 years 9 months ago
2008
Springer
In cryptography, there has been tremendous success in building various two-party protocols with small communication complexity out of homomorphic semantically-secure encryption sc...
CDC
2010
IEEE
13 years 2 months ago
2010
IEEE
In this paper, we present a general algebraic framework for analysing decentralized control systems. We consider systems defined by linear fractional functions over a commutative ...
CORR
2007
Springer
13 years 7 months ago
2007
Springer
We investigate the following question: if a polynomial can be evaluated at rational points by a polynomial-time boolean algorithm, does it have a polynomial-size arithmetic circuit...