Sciweavers

173 search results - page 10 / 35
» A Proof of the Two-path Conjecture
Sort
View
CADE
2007
Springer
16 years 6 months ago
SRASS - A Semantic Relevance Axiom Selection System
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...
Geoff Sutcliffe, Yury Puzis
WCE
2007
15 years 6 months ago
A Comparison of Mann and Ishikawa iterations of quasi-contraction operators
—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...
Johnson O. Olaleru
COMBINATORICA
2008
62views more  COMBINATORICA 2008»
15 years 5 months ago
The toric ideal of a graphic matroid is generated by quadrics
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...
Jonah Blasiak
DCG
1998
66views more  DCG 1998»
15 years 5 months ago
The Volume as a Metric Invariant of Polyhedra
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....
Idzhad Kh. Sabitov
FOCS
2009
IEEE
16 years 14 days ago
Resolving the Simultaneous Resettability Conjecture and a New Non-Black-Box Simulation Strategy
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...
Yi Deng, Vipul Goyal, Amit Sahai