923 search results - page 107 / 185 » On a generalization of Stickelberger's Theorem |
121
click to vote
STACS
2010
Springer
16 years 1 months ago
2010
Springer
The existence of a (p-)optimal propositional proof system is a major open question in (proof) complexity; many people conjecture that such systems do not exist. Kraj´ıˇcek and P...
154
click to vote
FOSSACS
2010
Springer
16 years 1 months ago
2010
Springer
Λµ-calculus was introduced as a Böhm-complete extension of Parigot's λµ-calculus. Λµ-calculus, contrarily to Parigot's calculus, is a calculus of CBN delimited con...
172
click to vote
WWW
2009
ACM
16 years 1 months ago
2009
ACM
Most of the approaches for dealing with uncertainty in the Semantic Web rely on the principle that this uncertainty is already asserted. In this paper, we propose a new approach t...
171
click to vote
STACS
2009
Springer
16 years 1 months ago
2009
Springer
We present the first polynomial-time approximation schemes (PTASes) for the following subset-connectivity problems in edge-weighted graphs of bounded genus: Steiner tree, low-conn...
179
click to vote
LICS
2008
IEEE
16 years 20 days ago
2008
IEEE
We present a syntax for MALL (multiplicative additive linear logic without units) proof nets which refines Girard’s one. It is also based on the use of monomial weights for ide...