138 search results - page 3 / 28 » Soft Linear Logic and Polynomial Complexity Classes |
175
click to vote
POPL
2008
ACM
15 years 10 months ago
2008
ACM
We propose a characterization of PSPACE by means of a type assignment for an extension of lambda calculus with a conditional construction. The type assignment STAB is an extension...
ICTCS
2003
Springer
15 years 2 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...
CSL
2009
Springer
15 years 1 months ago
2009
Springer
My talk will be a survey of recent results about the quest for a logic capturing polynomial time. In a fundamental study of database query languages, Chandra and Harel [4] first ra...
100
click to vote
CORR
2012
Springer
13 years 5 months ago
2012
Springer
A sequence fn(q) is q-holonomic if it satisfies a nontrivial linear recurrence with coefficients polynomials in q and qn . Our main theorem states that q-holonomicity is preserve...
CSL
2005
Springer
15 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...