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
Search
  Marx, Daniel Add to Alert Profile  
 
Options:
Date Reviewed  
  1 - 2 of 2 reviews    
  Parameterized algorithms
Cygan M., Fomin F., Kowalik Ł., Lokshtanov D., Marx D., Pilipczuk M., Pilipczuk M., Saurabh S., Springer International Publishing, New York, NY, 2015. 613 pp.  Type: Book (978-3-319212-74-6), Reviews: (2 of 2)

There are 36 definitions of complexity like the 36 flavors of ice cream! In simplest terms, complexity refers to the amount of resources consumed to execute an algorithm (resources here imply running time, space, computational effort, ...
...
Apr 13 2017  
  Parameterized algorithms
Cygan M., Fomin F., Kowalik Ł., Lokshtanov D., Marx D., Pilipczuk M., Pilipczuk M., Saurabh S., Springer International Publishing, New York, NY, 2015. 613 pp.  Type: Book (978-3-319212-74-6), Reviews: (1 of 2)

The topic of parameterized algorithms is one of the main subjects in modern computer science. In this type of algorithm analysis, the running time is a function of the size of the input data and of a set of one or more parameters. The ...
...
Feb 12 2016  

   
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud®
Terms of Use
| Privacy Policy