Sciweavers

173 search results - page 6 / 35
» A Proof of the Two-path Conjecture
Sort
View
CORR
2007
Springer
72views Education» more  CORR 2007»
13 years 7 months ago
A Proof of a Recursion for Bessel Moments
We provide a proof of a conjecture in [2] on the existence and form of linear recursions for moments of powers of the Bessel function K0.
Jonathan M. Borwein, Bruno Salvy
MST
2010
110views more  MST 2010»
13 years 5 months ago
Facets of the Fully Mixed Nash Equilibrium Conjecture
In this work, we continue the study of the many facets of the Fully Mixed Nash Equilibrium Conjecture, henceforth abbreviated as the FMNE Conjecture, in selfish routing for the s...
Rainer Feldmann, Marios Mavronicolas, Andreas Pier...
ECAI
2004
Springer
13 years 11 months ago
Lakatos-Style Automated Theorem Modification
We describe a flexible approach to automated reasoning, where non-theorems can be automatically altered to produce proved results which are related to the original. This is achieve...
Simon Colton, Alison Pease
STACS
2010
Springer
14 years 2 months ago
On Optimal Heuristic Randomized Semidecision Procedures, with Application to Proof Complexity
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...
Edward A. Hirsch, Dmitry Itsykson
CPC
2011
219views Education» more  CPC 2011»
13 years 2 months ago
On Percolation and the Bunkbed Conjecture
We study a problem on edge percolation on product graphs G× K2. Here G is any finite graph and K2 consists of two vertices {0, 1} connected by an edge. Every edge in G × K2 is p...
Svante Linusson