13603 search results - page 238 / 2721 » On the Computational Complexity of Cut-Reduction |
172
click to vote
FOCS
1990
IEEE
15 years 10 months ago
1990
IEEE
The lattice reduction algorithm of Gauss is shown to have an average case complexity which is asymptotic to a constant.
161
click to vote
BMCBI
2010
15 years 6 months ago
2010
Background: The study of biological systems demands computational support. If targeting a biological problem, the reuse of existing computational models can save time and effort. ...
184
click to vote
DAM
2007
15 years 6 months ago
2007
Given A := {a1, . . . , am} ⊂ Rd whose affine hull is Rd, we study the problems of computing an approximate rounding of the convex hull of A and an approximation to the minimum ...
208
click to vote
CODES
2007
IEEE
15 years 10 months ago
2007
IEEE
System-level and Platform-based design, along with Transaction Level modeling (TLM) techniques and languages like SystemC, appeared as a response to the ever increasing complexity...
171
click to vote
BMCBI
2008
15 years 6 months ago
2008
Background: Computational biology is often associated with genetic or genomic studies only. However, thanks to the increase of computational resources, computational models are ap...