Skip to content
UPFind
  • Košarica: 0 knjige/članki ZADETKI (Polno)
  • Jezik
    • 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
    • Монгол
    • Māori
Napredno
  • Hardness of approximation betw...
  • Citiraj
  • Pošljite email
  • Natisni
  • Izvozi zadetek
    • Export to RefWorks
    • Export to EndNoteWeb
    • Export to EndNote
    • Export to MARC
    • Export to MARCXML
  • Dodaj v košarico Odstrani iz košarice
  • Permanent link
Slika na naslovnici
QR koda
Predogled
Predogled
Predogled

Hardness of approximation between P and NP

Bibliografske podrobnosti
Glavni avtor: Rubinstein, Aviad (Author)
Format: Electronic Resource
Jezik:angleščina
Izdano: New York Association for Computing Machinery [2019]
Teme:
Algorithms.
Computer science > Mathematics.
Computers.
Data structures (Computer science).
Mathematical statistics.
Numerical analysis.
Electronic books.
Online dostop:Available for University of the Philippines Diliman via ACM Digital Library. Click here to access
Also available remotely for University of the Philippines Diliman via ACM Digital Library. Click here to access thru EZproxy
  • Zaloga
  • Opis
  • Predogled
  • Knjižničarski pogled

Search Options

  • Iskalna zgodovina
  • Napredno iskanje

Discover More

  • Prelistaj katalog
  • Explore Channels

Need Help?

  • Navodila za iskanje
  • Vprašaj knjižničarja
  • Pogosta vprašanja

More Information

  • About Tuklas
  • Contact Us

TUKLAS: UP Libraries' Resource Discovery Tool
Copyright © 2020-. The University Library, University of the Philippines Diliman