Sciweavers

173 search results - page 1 / 35
» A Proof of the Two-path Conjecture
Sort
View
ECCC
2010
95views more  ECCC 2010»
13 years 1 months ago
On optimal heuristic randomized semidecision procedures, with applications to proof complexity and cryptography
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
Edward A. Hirsch, Dmitry Itsykson, Ivan Monakhov, ...
ORL
2008
77views more  ORL 2008»
13 years 4 months ago
A short proof of the VPN Tree Routing Conjecture on ring networks
The VPN Tree Routing Conjecture states that there always exists an optimal solution to the symmetric Virtual Private Network Design (sVPND) problem where the paths between all ter...
Fabrizio Grandoni, Volker Kaibel, Gianpaolo Oriolo...
BIRTHDAY
2005
Springer
13 years 10 months ago
Psychological Validity of Schematic Proofs
Schematic proofs are functions which can produce a proof of a proposition for each value of their parameters. A schematic proof can be constructed by abstracting a general pattern ...
Mateja Jamnik, Alan Bundy
DCG
2010
53views more  DCG 2010»
13 years 4 months ago
A Revision of the Proof of the Kepler Conjecture
Abstract. The Kepler conjecture asserts that no packing of congruent balls in three-dimensional Euclidean space has density greater than that of the face-centered cubic packing. Th...
Thomas C. Hales, John Harrison, Sean McLaughlin, T...
DM
2010
66views more  DM 2010»
13 years 4 months ago
Two proofs of the Bermond-Thomassen conjecture for tournaments with bounded minimum in-degree
The Bermond-Thomassen conjecture states that, for any positive integer r, a digraph of minimum out-degree at least 2r -1 contains at least r vertex-disjoint directed cycles. Thoma...
Stéphane Bessy, Nicolas Lichiardopol, Jean-...