2060 search results - page 68 / 412 » Some Applications of Coding Theory in Computational Complexi... |
RT
1998
Springer
15 years 1 months ago
1998
Springer
Abstract. There has been great success in speeding up global illumination computation in diffuse environments. The concept of clustering allows radiosity computations even for scen...
IFIP
2004
Springer
15 years 3 months ago
2004
Springer
Abstract We propose an alternative notion of asymptotic behaviors for the study of type2 computational complexity. Since the classical asymptotic notion (for all but finitely many...
QCQC
1998
Springer
15 years 1 months ago
1998
Springer
Abstract. We consider the communication complexity of the binary inner product function in a variation of the two-party scenario where the parties have an a priori supply of partic...
FOCS
2002
IEEE
15 years 2 months ago
2002
IEEE
We obtain a near-tight bound of O(n3+ε ), for any ε > 0, on the complexity of the overlay of the minimization diagrams of two collections of surfaces in four dimensions. This...
FMCAD
2009
Springer
15 years 4 months ago
2009
Springer
— There is a long history of investigations and debates on whether a sequence of retiming and resynthesis is complete for all sequential transformations (on steady states). It ha...