281 search results - page 17 / 57 » The Proof Complexity of Linear Algebra |
ENTCS
2006
13 years 8 months ago
2006
Extending the work of [7] on groups definable in compact complex manifolds and of [1] on strongly minimal groups definable in nonstandard compact complex manifolds, we classify al...
ENTCS
2008
13 years 8 months ago
2008
Using linear algebraic techniques, we analyse the computational complexity of testing reachability in Petri nets for which markings can grow very fast. This leads to two subclasse...
CADE
2005
Springer
14 years 8 months ago
2005
Springer
Proof planning is an automated reasoning technique which improves proof search by raising it to a meta-level. In this paper we apply proof planning to First-Order Linear Temporal L...
ASIACRYPT
2009
Springer
13 years 12 months ago
2009
Springer
Proofs of storage (PoS) are interactive protocols allowing a client to verify that a server faithfully stores a file. Previous work has shown that proofs of storage can be constru...
CSR
2008
Springer
13 years 9 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...