Matches in SemOpenAlex for { <https://semopenalex.org/work/W2000607613> ?p ?o ?g. }
Showing items 1 to 60 of
60
with 100 items per page.
- W2000607613 endingPage "3596" @default.
- W2000607613 startingPage "3582" @default.
- W2000607613 abstract "Abstract The complexity of an algorithm is usually specified by the maximum number of steps made by the algorithm, as a function of the size of the input. However, as different inputs of equal size can yield dramatically different algorithm runtime, the size of the input is not always an appropriate basis for predicting algorithm runtime. In this paper, we argue that the compressed size of the input is more appropriate for this purpose. In particular, we devise a genetic algorithm for compressing a graph by finding the most compact description of its structure, and we demonstrate how the compressed size of the problem instance correlates with the runtime of an exact algorithm for two hard combinatorial problems (graph coloring and Boolean satisfiability)." @default.
- W2000607613 created "2016-06-24" @default.
- W2000607613 creator A5013047474 @default.
- W2000607613 creator A5051660284 @default.
- W2000607613 date "2013-08-01" @default.
- W2000607613 modified "2023-10-18" @default.
- W2000607613 title "Predicting algorithmic complexity through structure analysis and compression" @default.
- W2000607613 cites W1650993530 @default.
- W2000607613 cites W2005385221 @default.
- W2000607613 cites W2018663595 @default.
- W2000607613 cites W2034053794 @default.
- W2000607613 cites W2044636417 @default.
- W2000607613 cites W2055764977 @default.
- W2000607613 cites W2071744657 @default.
- W2000607613 cites W2105488035 @default.
- W2000607613 cites W2124996875 @default.
- W2000607613 cites W2137745608 @default.
- W2000607613 doi "https://doi.org/10.1016/j.asoc.2013.04.018" @default.
- W2000607613 hasPublicationYear "2013" @default.
- W2000607613 type Work @default.
- W2000607613 sameAs 2000607613 @default.
- W2000607613 citedByCount "4" @default.
- W2000607613 countsByYear W20006076132016 @default.
- W2000607613 countsByYear W20006076132018 @default.
- W2000607613 crossrefType "journal-article" @default.
- W2000607613 hasAuthorship W2000607613A5013047474 @default.
- W2000607613 hasAuthorship W2000607613A5051660284 @default.
- W2000607613 hasBestOaLocation W20006076132 @default.
- W2000607613 hasConcept C11413529 @default.
- W2000607613 hasConcept C159985019 @default.
- W2000607613 hasConcept C180016635 @default.
- W2000607613 hasConcept C192562407 @default.
- W2000607613 hasConcept C41008148 @default.
- W2000607613 hasConceptScore W2000607613C11413529 @default.
- W2000607613 hasConceptScore W2000607613C159985019 @default.
- W2000607613 hasConceptScore W2000607613C180016635 @default.
- W2000607613 hasConceptScore W2000607613C192562407 @default.
- W2000607613 hasConceptScore W2000607613C41008148 @default.
- W2000607613 hasIssue "8" @default.
- W2000607613 hasLocation W20006076131 @default.
- W2000607613 hasLocation W20006076132 @default.
- W2000607613 hasOpenAccess W2000607613 @default.
- W2000607613 hasPrimaryLocation W20006076131 @default.
- W2000607613 hasRelatedWork W1994690491 @default.
- W2000607613 hasRelatedWork W2116404931 @default.
- W2000607613 hasRelatedWork W2333698505 @default.
- W2000607613 hasRelatedWork W2351491280 @default.
- W2000607613 hasRelatedWork W2371447506 @default.
- W2000607613 hasRelatedWork W2374533549 @default.
- W2000607613 hasRelatedWork W2379432963 @default.
- W2000607613 hasRelatedWork W2380817024 @default.
- W2000607613 hasRelatedWork W2386767533 @default.
- W2000607613 hasRelatedWork W303980170 @default.
- W2000607613 hasVolume "13" @default.
- W2000607613 isParatext "false" @default.
- W2000607613 isRetracted "false" @default.
- W2000607613 magId "2000607613" @default.
- W2000607613 workType "article" @default.