173 search results - page 10 / 35 » A Proof of the Two-path Conjecture |
CADE
2007
Springer
14 years 7 months ago
2007
Springer
This paper describes the design, implementation, and testing of a system for selecting necessary axioms from a large set also containing superfluous axioms, to obtain a proof of a...
WCE
2007
13 years 8 months ago
2007
—It is generally conjectured that the Mann iteration converges faster than the Ishikawa iteration for any operator defined on an arbitrary closed convex subset of a Banach space...
COMBINATORICA
2008
13 years 7 months ago
2008
Describing minimal generating sets of toric ideals is a well-studied and difficult problem. Neil White conjectured in 1980 that the toric ideal associated to a matroid is generated...
DCG
1998
13 years 7 months ago
1998
It is proved that in R3 the volume of any polyhedron is a root of some polynomial with coefficients depending only on the combinatorial structure and the metric of the polyhedron....
FOCS
2009
IEEE
14 years 2 months ago
2009
IEEE
Canetti, Goldreich, Goldwasser, and Micali (STOC 2000) introduced the notion of resettable zeroknowledge proofs, where the protocol must be zero-knowledge even if a cheating veri...