1717 search results - page 186 / 344 » A Computable Spectral Theorem |
150
click to vote
CIE
2009
Springer
16 years 25 days ago
2009
Springer
We introduce the parameter cutwidth for the Cutting Planes (CP) system of Gomory and Chv´atal. We provide linear lower bounds on cutwidth for two simple polytopes. Considering CP ...
154
click to vote
FOCS
2008
IEEE
16 years 22 days ago
2008
IEEE
The parallel repetition theorem states that for any two-prover game, with value 1 − (for, say, ≤ 1/2), the value of the game repeated in parallel n times is at most (1 − c)...
156
click to vote
GG
2004
Springer
15 years 11 months ago
2004
Springer
The concept of typed attributed graph transformation is most significant for modeling and meta modeling in software engineering and visual languages, but up to now there is no ade...
189
click to vote
AIMSA
1998
Springer
15 years 10 months ago
1998
Springer
The acceptance and usability of current interactive theorem proving environments is, among other things, strongly influenced by the availability of an intelligent default suggestio...
190
click to vote
DAC
1994
ACM
15 years 10 months ago
1994
ACM
We provide a new theoretical framework for constructing Steiner routing trees with minimum Elmore delay. Earlier work [3, 13] has established Elmore delay as a high delity estima...