Skip to content
VuFind
    • English
    • Deutsch
    • Español
    • Français
    • Italiano
    • 日本語
    • Nederlands
    • Português
    • Português (Brasil)
    • 中文(简体)
    • 中文(繁體)
    • Türkçe
    • עברית
    • Gaeilge
    • Cymraeg
    • Ελληνικά
    • Català
    • Euskara
    • Русский
    • Čeština
    • Suomi
    • Svenska
    • polski
    • Dansk
    • slovenščina
    • اللغة العربية
    • বাংলা
    • Galego
    • Tiếng Việt
    • Hrvatski
    • हिंदी
    • Հայերէն
    • Українська
    • Sámegiella
    • Монгол
Advanced
  • Discrete algorithms and comple...
  • Cite this
  • Text this
  • Email this
  • Print
  • Export Record
    • Export to RefWorks
    • Export to EndNoteWeb
    • Export to EndNote
  • Permanent link
Export Ready — 
Discrete algorithms and complexity /

Discrete algorithms and complexity /

57

Bibliographic Details
Main Authors: Johnson, David S., Japan-US Joint Seminar on Discrete Algorithms and Complexity Theory (1986 : Kyoto, Japan)
Format:
Published: Boston : Academic Press, 1987
Subjects:
Electronic digital computers
Algorithms
Computational complexity
  • Holdings
  • Description
  • Similar Items
  • Staff View

Similar Items

  • Fundamental algorithms for computer graphics /
    by: Earnshaw, Rae A., 1944-, et al.
    Published: (1985)
  • Computer and intractability : a guide to the theory of NP-completeness /
    by: 403671 Garey, Michael R., et al.
    Published: (1979)
  • A guide to algorithm design : paradigms, methods, and complexity analysis /
    by: Benoit, Anne, et al.
    Published: (2014)
  • Algorithms /
    by: 453949 Sedgewick, Robert
    Published: (1983)
  • Introduction to algorithms /
    by: 307374 Cormen, Thomas H., et al.
    Published: (1989)

Search Options

  • Search History
  • Advanced Search

Find More

  • Browse the Catalog
  • Browse Alphabetically
  • Explore Channels
  • Course Reserves
  • New Items

Need Help?

  • Search Tips
  • Ask a Librarian
  • FAQs