Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

26

COMPUTING
1998

favoriteEmaildiscussreport

72views more COMPUTING 1998»

Worst-Case Versus Average Case Complexity of Ray-Shooting

13 years 10 months ago

Worst-Case Versus Average Case Complexity of Ray-Shooting

Download www.fsz.bme.hu

László Szirmay-Kalos, Gábor M

Real-time Traffic

COMPUTING 1998 |

claim paper

Related Content

» Investigating Average versus WorstCase Timing Behavior of Data Caches and Data Scratchpads

» WorstCase and AverageCase Approximations by Simple Randomized Search Heuristics

» WorstCase to AverageCase Reductions Revisited

» On WorstCase to AverageCase Reductions for NP Problems

» NearOptimal WorstCase Throughput Routing for TwoDimensional Mesh Networks

» Time Optimal Algorithms for Black Hole Search in Rings

» On the Theory of Average Case Complexity

» A Complete and Tight AverageCase Analysis of Learning Monomials

» On Approximating Optimal Weighted Lobbying and Frequency of Correctness Versus AverageCase...

Post Info
More Details (n/a)

Added	22 Dec 2010
Updated	22 Dec 2010
Type	Journal
Year	1998
Where	COMPUTING
Authors	László Szirmay-Kalos, Gábor Márton

Comments (0)