Sciweavers

4 search results - page 1 / 1
» After All, There Are Some Inequalities Which Are Provable in...
Sort
View
JSYML
2000
66views more  JSYML 2000»
13 years 7 months ago
After All, There Are Some Inequalities Which Are Provable in ZFC
We address ZFC inequalities between some cardinal invariants of the continuum, which turned to be true in spite of strong expectations given by [10].
Tomek Bartoszynski, Andrzej Roslanowski, Saharon S...
FAC
2008
108views more  FAC 2008»
13 years 7 months ago
Property-directed incremental invariant generation
Abstract. A fundamental method of analyzing a system such as a program or a circuit is invariance analysis, in which one proves that an assertion holds on all reachable states. Typ...
Aaron R. Bradley, Zohar Manna
STOC
2009
ACM
136views Algorithms» more  STOC 2009»
14 years 8 months ago
Random walks on polytopes and an affine interior point method for linear programming
Let K be a polytope in Rn defined by m linear inequalities. We give a new Markov Chain algorithm to draw a nearly uniform sample from K. The underlying Markov Chain is the first t...
Ravi Kannan, Hariharan Narayanan
ISQED
2005
IEEE
81views Hardware» more  ISQED 2005»
14 years 1 months ago
Exact Algorithms for Coupling Capacitance Minimization by Adding One Metal Layer
Due to the rapid development of manufacturing process technology and tight marketing schedule, the chip design and manufacturing always work toward an integrated solution to achie...
Hua Xiang, Kai-Yuan Chao, Martin D. F. Wong