Back to Results
First PageMeta Content
Operations research / NP-complete problems / Search algorithms / Analysis of algorithms / Boolean satisfiability problem / Backtracking / Algorithm / PP / Time complexity / Theoretical computer science / Applied mathematics / Computational complexity theory


16th Canadian Conference on Computational Geometry, 2004 An Average Running Time Analysis of a Backtracking Algorithm to Calculate the Measure of the Union of Hyperrectangles in Dimensions Susumu Suzuki 
Add to Reading List

Document Date: 2004-08-23 15:27:23


Open Document

File Size: 35,24 KB

Share Result on Facebook

City

Sanda / /

Company

Toyota / /

Country

Japan / /

/

Facility

Kwansei Gakuin University / Aichi Institute of Tech / /

IndustryTerm

worst-case time algorithm / /

Organization

Aichi Institute of Tech / Nitto Foundation / Department of Informatics / Kwansei Gakuin University / Union of Hyperrectangles / Department of Applied Information Science / /

Person

Toshihide Ibaraki / Susumu Suzuki / /

Position

author / /

Technology

worst-case time algorithm / backtracking algorithm / /

SocialTag