Skip to main content alibris logo
Image not available
Filter Results
Item Condition
Seller Rating
Other Options
Change Currency
Browse related Subjects
+ Browse All Subjects

These papers embrace many topics of theoretical computer science, including algorithm problems on lattices, parallel computing, maze searching, NP-hard and NP-complete problems and some new approaches to characterize computational complexity. mmunication Complexity (F. Hossfeld). Tight Worst-Case Bounds for Bin-Packing Algorithms (A. Ivanyi). Hypergraph Planarity and the Complexity of Drawing Venn Diagrams (D.S. Johnson and H.O. Pollak). Convolutional Charaterization of Computability and Complexity of Computations (S. Jukna ...

loading
Theory of Algorithms 1986, Elsevier Science & Technology

ISBN-13: 9780444877604

Hardcover