Skip to content
Warning: Full texts of licensed resources are only available from the TBU university network. You are currently outside this network.
Please log in to access full texts 
Portal K.UTB
  • ikona jazykČeština
  • ikona přihlášení Login
logo knihovny
  • TBU Catalog
  • e-resources
  • E-THESES
Advanced Search
  • On Hardness of Approximating t...
Toolbar
  • ikona citování Cite this
  • ikona bookmark Save to List
  • ikona export Export Record
    • Export to CitacePRO
    • Export to RefWorks
    • Export to EndNoteWeb
    • Export to EndNote
    • Export to RIS
  • ikona email Email this
  • ikona permanent link Permanent link
Export Ready — 

On Hardness of Approximating the Parameterized Clique Problem

Saved in:
Bibliographic Details
Published inProceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science
Format Conference Proceeding
LanguageEnglish
Online AccessGet full text
DOI10.1145/2840728.2840733

Cover

Loading…
Cover Image
  • More Information
  • Metadata
More Information
DOI:10.1145/2840728.2840733
  • ikona citování Cite this
  • ikona bookmark Save to List
  • ikona export Export Record
    • Export to CitacePRO
    • Export to RefWorks
    • Export to EndNoteWeb
    • Export to EndNote
    • Export to RIS
  • ikona email Email this
  • ikona permanent link Permanent link

Search Options

  • Search History
  • Browse the Catalog
  • Browse Alphabetically
  • New Items

Find More with K.UTB

  • Opening Hours of the Library
  • Suggestion for Book Purchase
  • Interlibrary Loans
  • Printing and binding of the Theses

Do You Need Help?

  • Search Tips
  • FAQs
  • Feedback
  • Contacts
logo knihovny

Declaration of Accessibility | Cookies

Knihovna UTB ve Zlíně © 2025