Matches in SemOpenAlex for { <https://semopenalex.org/work/W4322717170> ?p ?o ?g. }
Showing items 1 to 79 of
79
with 100 items per page.
- W4322717170 abstract "In plenty of data analysis tasks, a basic and time-consuming process is to produce a large number of solutions and feed them into downstream processing. Various enumeration algorithms have been developed for this purpose. An enumeration algorithm produces all solutions of a problem instance without repetition. To be a statistically meaningful representation of the solution space, solutions are required to be enumerated in uniformly random order. This paper studies a set of self-reducible NP-problems in three hierarchies, where the problems are polynomially countable ($Sr_{NP}^{FP}$), admit FPTAS ($Sr_{NP}^{FPTAS}$), and admit FPRAS ($Sr_{NP}^{FPRAS}$), respectively. The trivial algorithm based on a (almost) uniform generator is in fact inefficient. We provide a new insight that the (almost) uniform generator is not the end of the story. More efficient algorithmic frameworks are proposed to enumerate solutions in uniformly random order for problems in these three hierarchies. (1) For problems in $Sr_{NP}^{FP}$, we show a random-order enumeration algorithm with polynomial delay (PDREnum); (2) For problems in $Sr_{NP}^{FPTAS}$, we show a Las Vegas random-order enumeration algorithm with expected polynomial delay (PDLVREnum); (3) For problems in $Sr_{NP}^{FPRAS}$, we devise a fully polynomial delay Atlantic City random-order enumeration algorithm with expected delay polynomial in the input size and the given error probability $delta$ (FPACREnum), which has a probability of at least $1-delta$ becoming a Las Vegas random-order enumeration algorithm. Finally, to further improve the efficiency of the random-order enumeration algorithms, based on the master/slave paradigm, we present a parallelization with 1.5-optimal enumeration delay and running time, along with the theoretical analysis." @default.
- W4322717170 created "2023-03-03" @default.
- W4322717170 creator A5000093173 @default.
- W4322717170 creator A5032891611 @default.
- W4322717170 creator A5043815322 @default.
- W4322717170 creator A5067621571 @default.
- W4322717170 creator A5077372703 @default.
- W4322717170 creator A5089467202 @default.
- W4322717170 date "2023-02-27" @default.
- W4322717170 modified "2023-09-27" @default.
- W4322717170 title "Random-Order Enumeration for Self-Reducible NP-Problems" @default.
- W4322717170 doi "https://doi.org/10.48550/arxiv.2302.13549" @default.
- W4322717170 hasPublicationYear "2023" @default.
- W4322717170 type Work @default.
- W4322717170 citedByCount "0" @default.
- W4322717170 crossrefType "posted-content" @default.
- W4322717170 hasAuthorship W4322717170A5000093173 @default.
- W4322717170 hasAuthorship W4322717170A5032891611 @default.
- W4322717170 hasAuthorship W4322717170A5043815322 @default.
- W4322717170 hasAuthorship W4322717170A5067621571 @default.
- W4322717170 hasAuthorship W4322717170A5077372703 @default.
- W4322717170 hasAuthorship W4322717170A5089467202 @default.
- W4322717170 hasBestOaLocation W43227171701 @default.
- W4322717170 hasConcept C10138342 @default.
- W4322717170 hasConcept C11413529 @default.
- W4322717170 hasConcept C114614502 @default.
- W4322717170 hasConcept C118615104 @default.
- W4322717170 hasConcept C121332964 @default.
- W4322717170 hasConcept C134306372 @default.
- W4322717170 hasConcept C142724271 @default.
- W4322717170 hasConcept C156340839 @default.
- W4322717170 hasConcept C158739034 @default.
- W4322717170 hasConcept C162324750 @default.
- W4322717170 hasConcept C163258240 @default.
- W4322717170 hasConcept C182306322 @default.
- W4322717170 hasConcept C2780992000 @default.
- W4322717170 hasConcept C2993101906 @default.
- W4322717170 hasConcept C311688 @default.
- W4322717170 hasConcept C33923547 @default.
- W4322717170 hasConcept C41008148 @default.
- W4322717170 hasConcept C62520636 @default.
- W4322717170 hasConcept C71924100 @default.
- W4322717170 hasConcept C90119067 @default.
- W4322717170 hasConceptScore W4322717170C10138342 @default.
- W4322717170 hasConceptScore W4322717170C11413529 @default.
- W4322717170 hasConceptScore W4322717170C114614502 @default.
- W4322717170 hasConceptScore W4322717170C118615104 @default.
- W4322717170 hasConceptScore W4322717170C121332964 @default.
- W4322717170 hasConceptScore W4322717170C134306372 @default.
- W4322717170 hasConceptScore W4322717170C142724271 @default.
- W4322717170 hasConceptScore W4322717170C156340839 @default.
- W4322717170 hasConceptScore W4322717170C158739034 @default.
- W4322717170 hasConceptScore W4322717170C162324750 @default.
- W4322717170 hasConceptScore W4322717170C163258240 @default.
- W4322717170 hasConceptScore W4322717170C182306322 @default.
- W4322717170 hasConceptScore W4322717170C2780992000 @default.
- W4322717170 hasConceptScore W4322717170C2993101906 @default.
- W4322717170 hasConceptScore W4322717170C311688 @default.
- W4322717170 hasConceptScore W4322717170C33923547 @default.
- W4322717170 hasConceptScore W4322717170C41008148 @default.
- W4322717170 hasConceptScore W4322717170C62520636 @default.
- W4322717170 hasConceptScore W4322717170C71924100 @default.
- W4322717170 hasConceptScore W4322717170C90119067 @default.
- W4322717170 hasLocation W43227171701 @default.
- W4322717170 hasOpenAccess W4322717170 @default.
- W4322717170 hasPrimaryLocation W43227171701 @default.
- W4322717170 hasRelatedWork W1522338998 @default.
- W4322717170 hasRelatedWork W1997438504 @default.
- W4322717170 hasRelatedWork W2021372200 @default.
- W4322717170 hasRelatedWork W2031344019 @default.
- W4322717170 hasRelatedWork W2112972328 @default.
- W4322717170 hasRelatedWork W2402358307 @default.
- W4322717170 hasRelatedWork W3094179009 @default.
- W4322717170 hasRelatedWork W4221160330 @default.
- W4322717170 hasRelatedWork W4298625440 @default.
- W4322717170 hasRelatedWork W2185673134 @default.
- W4322717170 isParatext "false" @default.
- W4322717170 isRetracted "false" @default.
- W4322717170 workType "article" @default.