Show simple item record

dc.contributor.authorBreuer, Thomas
dc.contributor.authorPfeiffer, Götz
dc.date.accessioned2018-08-24T08:24:11Z
dc.date.available2018-08-24T08:24:11Z
dc.date.issued1998-09-01
dc.identifier.citationBreuer, Thomas; Pfeiffer, Götz (1998). Finding possible permutation characters. Journal of Symbolic Computation 26 (3), 343-354
dc.identifier.issn0747-7171
dc.identifier.urihttp://hdl.handle.net/10379/8898
dc.publisherElsevier BV
dc.relation.ispartofJournal of Symbolic Computation
dc.rightsAttribution-NonCommercial-NoDerivs 3.0 Ireland
dc.rights.urihttps://creativecommons.org/licenses/by-nc-nd/3.0/ie/
dc.titleFinding possible permutation characters
dc.typeArticle
dc.identifier.doi10.1006/jsco.1998.0217
dc.local.publishedsourcehttps://doi.org/10.1006/jsco.1998.0217
nui.item.downloads0


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record

Attribution-NonCommercial-NoDerivs 3.0 Ireland
Except where otherwise noted, this item's license is described as Attribution-NonCommercial-NoDerivs 3.0 Ireland