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
  • Polynomial-delay enumeration a...
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

Polynomial-delay enumeration algorithms in set systems

Saved in:
Bibliographic Details
Published inTheoretical Computer Science Vol. 963; p. 113963
Main Authors Kazuya Haraguchi, Hiroshi Nagamochi
Format Journal Article
LanguageJapanese
Published Elsevier BV 01.06.2023
Subjects
Computer Science - Data Structures and Algorithms
Computer Science - Discrete Mathematics
Data Structures and Algorithms (cs.DS)
Discrete Mathematics (cs.DM)
FOS: Computer and information sciences
G.2.1
G.2.1; G.2.2
G.2.2
Online AccessGet full text
ISSN0304-3975
DOI10.48550/arxiv.2004.07823

Cover

Loading…
Cover Image
  • More Information
  • Metadata
More Information
ISSN:0304-3975
DOI:10.48550/arxiv.2004.07823
  • 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