Sciweavers

1920 search results - page 5 / 384
» The Complexity of the A B C Problem
Sort
View
CORR
1998
Springer
75views Education» more  CORR 1998»
15 years 6 months ago
The Complexity of Planar Counting Problems
Harry B. Hunt III, Madhav V. Marathe, Venkatesh Ra...
CASES
2006
ACM
16 years 16 days ago
Modeling heterogeneous SoCs with SystemC: a digital/MEMS case study
Designers of SoCs with non-digital components, such as analog or MEMS devices, can currently use high-level system design languages, such as SystemC, to model only the digital par...
Ankush Varma, Muhammad Yaqub Afridi, Akin Akturk, ...
MP
2011
15 years 1 months ago
Smoothed analysis of condition numbers and complexity implications for linear programming
We perform a smoothed analysis of Renegar’s condition number for linear programming by analyzing the distribution of the distance to ill-posedness of a linear program subject to...
John Dunagan, Daniel A. Spielman, Shang-Hua Teng
IWOCA
2009
Springer
112views Algorithms» more  IWOCA 2009»
15 years 11 months ago
The Guarding Problem - Complexity and Approximation
T. V. Thirumala Reddy, D. Sai Krishna, C. Pandu Ra...