Sciweavers

923 search results - page 25 / 185
» On a generalization of Stickelberger's Theorem
Sort
View
LICS
1997
IEEE
13 years 10 months ago
Automata, Tableaus and a Reduction Theorem for Fixpoint Calculi in Arbitrary Complete Lattices
Fixpoint expressions built from functional signatures interpreted over arbitrary complete lattices are considered. A generic notionof automatonis defined and shown, by means of a ...
David Janin
SIAMJO
2010
58views more  SIAMJO 2010»
13 years 5 months ago
Tame Nonsmooth Inverse Mapping Theorems
We give several versions of local and global inverse mapping theorem for tame non necessarily smooth, mappings. Here tame mapping means a mapping which is subanalytic or, more gene...
Toshizumi Fukui, Krzysztof Kurdyka, Laurentiu Paun...
DLT
2009
13 years 4 months ago
On the Complexity of Hmelevskii's Theorem and Satisfiability of Three Unknown Equations
Abstract. We analyze Hmelevskii's theorem, which states that the general solutions of constant-free equations on three unknowns are expressible by a finite collection of formu...
Aleksi Saarela
STOC
2004
ACM
134views Algorithms» more  STOC 2004»
14 years 7 months ago
Approximate max-integral-flow/min-multicut theorems
We establish several approximate max-integral-flow / minmulticut theorems. While in general this ratio can be very large, we prove strong approximation ratios in the case where th...
Kenji Obata
SIGMOD
2009
ACM
185views Database» more  SIGMOD 2009»
14 years 7 months ago
Attacks on privacy and deFinetti's theorem
In this paper we present a method for reasoning about privacy using the concepts of exchangeability and deFinetti's theorem. We illustrate the usefulness of this technique by...
Daniel Kifer