182 search results - page 11 / 37 » The Proof Complexity of Polynomial Identities |
CSL
2005
Springer
14 years 3 months ago
2005
Springer
We show that Csanky’s fast parallel algorithm for computing the characteristic polynomial of a matrix can be formalized in the logical theory LAP, and can be proved correct in LA...
CSL
2008
Springer
13 years 11 months ago
2008
Springer
We present a game-based semantic framework in which the time complexity of any IMELL proof can be read out of its interpretation. This gives a compositional view of the geometry of...
RTA
2010
Springer
14 years 1 months ago
2010
Springer
In earlier work, we have shown that for confluent term rewrite systems (TRSs for short), innermost polynomial runtime complexity induces polytime computability of the functions de...
COLOGNETWENTE
2010
13 years 8 months ago
2010
In this paper we analyze O’Hara’s partition bijection. We present three type of results. First, we show that O’Hara’s bijection can be viewed geometrically as a certain sci...
DIM
2005
ACM
13 years 11 months ago
2005
ACM
We develop solutions for the security and privacy of user identity information in a federation. By federation we mean a group of organizations or service providers which have buil...