Sciweavers

179 search results - page 10 / 36
» The proof of Hermann's conjecture
Sort
View
COMBINATORICA
2008
62views more  COMBINATORICA 2008»
14 years 12 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»
14 years 11 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
15 years 6 months 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
COMBINATORICA
2008
112views more  COMBINATORICA 2008»
14 years 12 months ago
On the rigidity of molecular graphs
The rigidity of squares of graphs in three-space has important applications to the study of flexibility in molecules. The Molecular Conjecture, posed in 1984 by T-S. Tay and W. Wh...
Bill Jackson, Tibor Jordán
CJ
2006
78views more  CJ 2006»
14 years 11 months ago
A Very Mathematical Dilemma
Mathematics is facing a dilemma at its heart: the nature of mathematical proof. We have known since Church and Turing independently showed that mathematical provability was undeci...
Alan Bundy