Sciweavers

769 search results - page 28 / 154
» Where Is the Proof
Sort
View
CIE
2008
Springer
13 years 9 months ago
Many Facets of Complexity in Logic
There are many ways to define complexity in logic. In finite model theory, it is the complexity of describing properties, whereas in proof complexity it is the complexity of provin...
Antonina Kolokolova
APAL
2008
80views more  APAL 2008»
13 years 7 months ago
System BV is NP-complete
System BV is an extension of multiplicative linear logic (MLL) with the rules mix, nullary mix, and a self-dual, non-commutative logical operator, called seq. While the rules mix ...
Ozan Kahramanogullari
TCS
2008
13 years 7 months ago
Making the use of maximal ideals constructive
The purpose of this paper is to decipher constructively a lemma of Suslin which played a central role in his second solution of Serre's problem on projective modules over pol...
Ihsen Yengui
ALT
2008
Springer
14 years 4 months ago
A Uniform Lower Error Bound for Half-Space Learning
Abstract. We give a lower bound for the error of any unitarily invariant algorithm learning half-spaces against the uniform or related distributions on the unit sphere. The bound i...
Andreas Maurer, Massimiliano Pontil
CORR
2010
Springer
58views Education» more  CORR 2010»
13 years 7 months ago
A calculus for costed computations
We develop a version of the picalculus Picost where channels are interpreted as resources which have costs associated with them. Code runs under the financial responsibility of own...
Matthew Hennessy