FRINK Linked Data Fragments server

Matches in SemOpenAlex for { <https://semopenalex.org/work/W2007134090> ?p ?o ?g. }

• W2007134090 abstract "In [2] we demonstrated that overlapping sums of products arising in the Hensel lifting phase of the polytope factoring method using a Max priority queue reduces expression swell and achieves asymptotic reductions in the Hensel lifting phase. In this paper, we propose to implement the priority queue as a Funnel Heap, when polynomials are in sparse distributed representation. Funnel Heap is a cache oblivious priority queue with optimal cache complexity, and we additionally tailor several of its features to the polynomial arithmetic required. Funnel Heap is able to identify equal order monomials free whilst it re-organises itself over sufficiently many updates. We adopt a batched mode for chaining equal order monomials that gets overlapped with Funnel Heap's mechanism for emptying its in-core components. We also develop a customised analysis of performance that captures the overhead due to chaining in terms of the fraction of reduction and replication observed in the queue, and get that batched chaining is sensitive to the number of distinct monomials residing in the queue, as opposed to the number of replicas chained. For sufficiently large input size with respect to the cache-line length, batched chaining that is search free leads to an implementation of Hensel lifting that exhibits optimal cache complexity in the number of replicas found in the queue. Additionally, we obtain an order of magnitude reduction in space, as well as a reduction in the logarithmic factor in work and cache complexity, when comparing our adaptation against [2]. Also, the resulting Hensel lifting process is cache-oblivious. Our benchmarks of the polytope method using Funnel Heap with chaining demonstrate dramatic improvements over the regular binary heap as well as MAGMA, where the latter fails to process sufficiently high degree but sparse polynomial factorisations." @default.
• W2007134090 created "2016-06-24" @default.
• W2007134090 creator A5038462642 @default.
• W2007134090 creator A5068257326 @default.
• W2007134090 creator A5076891738 @default.
• W2007134090 date "2015-07-10" @default.
• W2007134090 modified "2023-10-14" @default.
• W2007134090 title "Cache oblivious sparse polynomial factoring using the funnel heap" @default.
• W2007134090 cites W2018425753 @default.
• W2007134090 cites W2022117185 @default.
• W2007134090 cites W2033042165 @default.
• W2007134090 cites W2043135185 @default.
• W2007134090 cites W2113737071 @default.
• W2007134090 cites W2132108235 @default.
• W2007134090 cites W2140126816 @default.
• W2007134090 cites W4205954884 @default.
• W2007134090 doi "https://doi.org/10.1145/2790282.2790283" @default.
• W2007134090 hasPublicationYear "2015" @default.
• W2007134090 type Work @default.
• W2007134090 sameAs 2007134090 @default.
• W2007134090 citedByCount "1" @default.
• W2007134090 countsByYear W20071340902016 @default.
• W2007134090 crossrefType "proceedings-article" @default.
• W2007134090 hasAuthorship W2007134090A5038462642 @default.
• W2007134090 hasAuthorship W2007134090A5068257326 @default.
• W2007134090 hasAuthorship W2007134090A5076891738 @default.
• W2007134090 hasConcept C10138342 @default.
• W2007134090 hasConcept C11413529 @default.
• W2007134090 hasConcept C115537543 @default.
• W2007134090 hasConcept C134757568 @default.
• W2007134090 hasConcept C162324750 @default.
• W2007134090 hasConcept C173608175 @default.
• W2007134090 hasConcept C177225278 @default.
• W2007134090 hasConcept C41008148 @default.
• W2007134090 hasConcept C80444323 @default.
• W2007134090 hasConceptScore W2007134090C10138342 @default.
• W2007134090 hasConceptScore W2007134090C11413529 @default.
• W2007134090 hasConceptScore W2007134090C115537543 @default.
• W2007134090 hasConceptScore W2007134090C134757568 @default.
• W2007134090 hasConceptScore W2007134090C162324750 @default.
• W2007134090 hasConceptScore W2007134090C173608175 @default.
• W2007134090 hasConceptScore W2007134090C177225278 @default.
• W2007134090 hasConceptScore W2007134090C41008148 @default.
• W2007134090 hasConceptScore W2007134090C80444323 @default.
• W2007134090 hasLocation W20071340901 @default.
• W2007134090 hasOpenAccess W2007134090 @default.
• W2007134090 hasPrimaryLocation W20071340901 @default.
• W2007134090 hasRelatedWork W1484089092 @default.
• W2007134090 hasRelatedWork W1529387754 @default.
• W2007134090 hasRelatedWork W1558545464 @default.
• W2007134090 hasRelatedWork W1571368810 @default.
• W2007134090 hasRelatedWork W1579918296 @default.
• W2007134090 hasRelatedWork W1616582327 @default.
• W2007134090 hasRelatedWork W1784146144 @default.
• W2007134090 hasRelatedWork W1796231360 @default.
• W2007134090 hasRelatedWork W2372170743 @default.
• W2007134090 hasRelatedWork W2379400621 @default.
• W2007134090 isParatext "false" @default.
• W2007134090 isRetracted "false" @default.
• W2007134090 magId "2007134090" @default.
• W2007134090 workType "article" @default.