1322 search results - page 120 / 265 » Unsound Theorem Proving |
COCO
2004
Springer
14 years 3 months ago
2004
Springer
We prove a very general lower bound technique for quantum and randomized query complexity, that is easy to prove as well as to apply. To achieve this, we introduce the use of Kolm...
CHARME
2003
Springer
14 years 3 months ago
2003
Springer
Intrusion-tolerance is the technique of using fault-tolerance to achieve security properties. Assuming that faults, both benign and Byzantine, are unavoidable, the main goal of Int...
DCG
2010
13 years 10 months ago
2010
We study the multiplicity modulo 2 of real analytic hypersurfaces. We prove that, under some assumptions on the singularity, the multiplicity modulo 2 is preserved by subanalytic b...
DM
2008
13 years 10 months ago
2008
Let G be a minimally k-connected graph with n nodes and m edges. Mader proved that if n 3k - 2 then m k(n - k), and for n 3k - 1 an equality is possible if, and only if, G is t...
SIAMCOMP
2008
13 years 10 months ago
2008
Abstract. Monadic second-order unification is second-order unification where all function constants occurring in the equations are unary. Here we prove that the problem of deciding...