Matches in SemOpenAlex for { <https://semopenalex.org/work/W2015970419> ?p ?o ?g. }
Showing items 1 to 59 of
59
with 100 items per page.
- W2015970419 endingPage "93" @default.
- W2015970419 startingPage "81" @default.
- W2015970419 abstract "The relative complexity of the following problems on abelian groups represented by an explicit set of generators is investigated: (i) computing a set of defining relations, (ii) computing the order of an element, (iii) membership testing, (iv) testing whether or not a group is cyclic, (v) computing the canonical structure of an abelian group. Polynomial time reductions among the above problems are established. Moreover the problem of ‘prime factorization’ is shown to be polynomial time reducible to the problems (i), (ii), (iii), and (v) and ‘primality testing’ is shown to be polynomial time reducible to the problem (iv). Therefore, the group-theoretic problems above are computationally harder than factorization and primality testing." @default.
- W2015970419 created "2016-06-24" @default.
- W2015970419 creator A5058155947 @default.
- W2015970419 date "1985-01-01" @default.
- W2015970419 modified "2023-10-05" @default.
- W2015970419 title "Computing in general abelian groups is hard" @default.
- W2015970419 cites W2012857639 @default.
- W2015970419 cites W2015161630 @default.
- W2015970419 cites W2075056391 @default.
- W2015970419 cites W2083368929 @default.
- W2015970419 cites W2329291360 @default.
- W2015970419 cites W4245904671 @default.
- W2015970419 doi "https://doi.org/10.1016/0304-3975(85)90061-1" @default.
- W2015970419 hasPublicationYear "1985" @default.
- W2015970419 type Work @default.
- W2015970419 sameAs 2015970419 @default.
- W2015970419 citedByCount "10" @default.
- W2015970419 countsByYear W20159704192013 @default.
- W2015970419 countsByYear W20159704192017 @default.
- W2015970419 countsByYear W20159704192018 @default.
- W2015970419 countsByYear W20159704192020 @default.
- W2015970419 countsByYear W20159704192022 @default.
- W2015970419 crossrefType "journal-article" @default.
- W2015970419 hasAuthorship W2015970419A5058155947 @default.
- W2015970419 hasBestOaLocation W20159704191 @default.
- W2015970419 hasConcept C114614502 @default.
- W2015970419 hasConcept C118615104 @default.
- W2015970419 hasConcept C136119220 @default.
- W2015970419 hasConcept C136170076 @default.
- W2015970419 hasConcept C202444582 @default.
- W2015970419 hasConcept C33923547 @default.
- W2015970419 hasConcept C41008148 @default.
- W2015970419 hasConceptScore W2015970419C114614502 @default.
- W2015970419 hasConceptScore W2015970419C118615104 @default.
- W2015970419 hasConceptScore W2015970419C136119220 @default.
- W2015970419 hasConceptScore W2015970419C136170076 @default.
- W2015970419 hasConceptScore W2015970419C202444582 @default.
- W2015970419 hasConceptScore W2015970419C33923547 @default.
- W2015970419 hasConceptScore W2015970419C41008148 @default.
- W2015970419 hasLocation W20159704191 @default.
- W2015970419 hasOpenAccess W2015970419 @default.
- W2015970419 hasPrimaryLocation W20159704191 @default.
- W2015970419 hasRelatedWork W1522036010 @default.
- W2015970419 hasRelatedWork W1562041956 @default.
- W2015970419 hasRelatedWork W1821847917 @default.
- W2015970419 hasRelatedWork W1975966127 @default.
- W2015970419 hasRelatedWork W1978042415 @default.
- W2015970419 hasRelatedWork W2006990530 @default.
- W2015970419 hasRelatedWork W2021494526 @default.
- W2015970419 hasRelatedWork W2963456550 @default.
- W2015970419 hasRelatedWork W3126773016 @default.
- W2015970419 hasRelatedWork W776536739 @default.
- W2015970419 hasVolume "41" @default.
- W2015970419 isParatext "false" @default.
- W2015970419 isRetracted "false" @default.
- W2015970419 magId "2015970419" @default.
- W2015970419 workType "article" @default.