Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Browse by topic Browse by titles Authors Reviewers Browse by issue Browse Help
  Browse All Reviews > Theory Of Computation (F) > Analysis Of Algorithms And Problem Complexity (F.2)  
  Analysis Of Algorithms And Problem Complexity (F.2) See Reviews  
General (322)
Numerical Algorithms And Problems (389)
Nonnumerical Algorithms And Problems (667)
Tradeoffs between Complexity Measures (27)
Miscellaneous (23)
Reviews limited to:

Reviews in category "Analysis Of Algorithms And Problem Complexity (F.2)":
Competitive programming in Python: 128 algorithms to develop your coding skills
Dürr C., Vie J.,  Cambridge University Press, Cambridge, UK, 2021. 264 pp. Type: Book (978-1-108716-82-6)
Multimodal scene understanding
Ying Yang M., Rosenhahn B., Murino V.,  ACADEMIC PRESS, London, UK, 2019. 412 pp. Type: Book (978-0-128173-58-9)
Numerical analysis: theory and experiments
Sutton B.,  SIAM-Society for Industrial and Applied Mathematics, Philadelphia, PA, 2019. 431 pp. Type: Book (978-1-611975-69-7)
Bandit algorithms
Lattimore T., Szepesvári C.,  Cambridge University Press, Cambridge, UK, 2020. 518 pp. Type: Book (978-1-108486-82-8)
 Exact algorithms via monotone local search
Fomin F., Gaspers S., Lokshtanov D., Saurabh S.  Journal of the ACM 66(2): 1-23, 2019. Type: Article

Related Topics

Analysis Of Algorithms And Problem Complexity
  - Logic Design
  - Integrated Circuits
  - Complexity Measures And Classes

Numerical Algorithms And Problems
  - Numerical Analysis
  - Mathematical Software
  - Symbolic and Algebraic Manipulation

Nonnumerical Algorithms And Problems
  - Data Storage Representations
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright © 2000-2022 ThinkLoud, Inc.
Terms of Use
| Privacy Policy