Algorithm 305: symmetric polynomial

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Communications of the ACM 1967-07, Vol.10 (7), p.450
Hauptverfasser: Bratley, P., McKay, J. K. S.
Format: Magazinearticle
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page
container_issue 7
container_start_page 450
container_title Communications of the ACM
container_volume 10
creator Bratley, P.
McKay, J. K. S.
description
doi_str_mv 10.1145/363427.363465
format Magazinearticle
fullrecord <record><control><sourceid>acm_cross</sourceid><recordid>TN_cdi_crossref_primary_10_1145_363427_363465</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>363465</sourcerecordid><originalsourceid>FETCH-LOGICAL-a2095-b153e11145bd69e60bba4d1ebdc73ae3c52f9e60e86c6f7769beb1c3fc9644433</originalsourceid><addsrcrecordid>eNo9j71PwzAQxS0EEqEwMrBFYnZ7F_vshq2q-JIqdYHZsh0HgmJS2V3y39MoFdPTvfvp6T3G7hGWiJJWQglZ6eUkii5YgUSaa4H6khUAgBz0urpmNzn_nE4gRQV73PRfQ-qO37EUQE9lHmMMx9T58jD04-8QO9vfsqvW9jncnXXBPl-eP7ZvfLd_fd9udtxWUBN3SCLg1MQ1qg4KnLOyweAar4UNwlPVTnZYK69arVXtgkMvWl8rKaUQC8bnXJ-GnFNozSF10abRIJgp18wLzbzwxD_MvPXxHz3__gC2XknT</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>magazinearticle</recordtype></control><display><type>magazinearticle</type><title>Algorithm 305: symmetric polynomial</title><source>Alma/SFX Local Collection</source><creator>Bratley, P. ; McKay, J. K. S.</creator><creatorcontrib>Bratley, P. ; McKay, J. K. S.</creatorcontrib><identifier>ISSN: 0001-0782</identifier><identifier>EISSN: 1557-7317</identifier><identifier>DOI: 10.1145/363427.363465</identifier><language>eng</language><publisher>New York, NY, USA: ACM</publisher><subject>Combinatorics ; Discrete mathematics ; Mathematics of computing</subject><ispartof>Communications of the ACM, 1967-07, Vol.10 (7), p.450</ispartof><rights>ACM</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-a2095-b153e11145bd69e60bba4d1ebdc73ae3c52f9e60e86c6f7769beb1c3fc9644433</citedby><cites>FETCH-LOGICAL-a2095-b153e11145bd69e60bba4d1ebdc73ae3c52f9e60e86c6f7769beb1c3fc9644433</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>776,780,27902</link.rule.ids></links><search><creatorcontrib>Bratley, P.</creatorcontrib><creatorcontrib>McKay, J. K. S.</creatorcontrib><title>Algorithm 305: symmetric polynomial</title><title>Communications of the ACM</title><addtitle>ACM CACM</addtitle><subject>Combinatorics</subject><subject>Discrete mathematics</subject><subject>Mathematics of computing</subject><issn>0001-0782</issn><issn>1557-7317</issn><fulltext>true</fulltext><rsrctype>magazinearticle</rsrctype><creationdate>1967</creationdate><recordtype>magazinearticle</recordtype><recordid>eNo9j71PwzAQxS0EEqEwMrBFYnZ7F_vshq2q-JIqdYHZsh0HgmJS2V3y39MoFdPTvfvp6T3G7hGWiJJWQglZ6eUkii5YgUSaa4H6khUAgBz0urpmNzn_nE4gRQV73PRfQ-qO37EUQE9lHmMMx9T58jD04-8QO9vfsqvW9jncnXXBPl-eP7ZvfLd_fd9udtxWUBN3SCLg1MQ1qg4KnLOyweAar4UNwlPVTnZYK69arVXtgkMvWl8rKaUQC8bnXJ-GnFNozSF10abRIJgp18wLzbzwxD_MvPXxHz3__gC2XknT</recordid><startdate>19670701</startdate><enddate>19670701</enddate><creator>Bratley, P.</creator><creator>McKay, J. K. S.</creator><general>ACM</general><scope>AAYXX</scope><scope>CITATION</scope></search><sort><creationdate>19670701</creationdate><title>Algorithm 305: symmetric polynomial</title><author>Bratley, P. ; McKay, J. K. S.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a2095-b153e11145bd69e60bba4d1ebdc73ae3c52f9e60e86c6f7769beb1c3fc9644433</frbrgroupid><rsrctype>magazinearticle</rsrctype><prefilter>magazinearticle</prefilter><language>eng</language><creationdate>1967</creationdate><topic>Combinatorics</topic><topic>Discrete mathematics</topic><topic>Mathematics of computing</topic><toplevel>online_resources</toplevel><creatorcontrib>Bratley, P.</creatorcontrib><creatorcontrib>McKay, J. K. S.</creatorcontrib><collection>CrossRef</collection><jtitle>Communications of the ACM</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Bratley, P.</au><au>McKay, J. K. S.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Algorithm 305: symmetric polynomial</atitle><jtitle>Communications of the ACM</jtitle><stitle>ACM CACM</stitle><date>1967-07-01</date><risdate>1967</risdate><volume>10</volume><issue>7</issue><spage>450</spage><pages>450-</pages><issn>0001-0782</issn><eissn>1557-7317</eissn><cop>New York, NY, USA</cop><pub>ACM</pub><doi>10.1145/363427.363465</doi><oa>free_for_read</oa></addata></record>
fulltext fulltext
identifier ISSN: 0001-0782
ispartof Communications of the ACM, 1967-07, Vol.10 (7), p.450
issn 0001-0782
1557-7317
language eng
recordid cdi_crossref_primary_10_1145_363427_363465
source Alma/SFX Local Collection
subjects Combinatorics
Discrete mathematics
Mathematics of computing
title Algorithm 305: symmetric polynomial
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-19T05%3A04%3A40IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-acm_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Algorithm%20305:%20symmetric%20polynomial&rft.jtitle=Communications%20of%20the%20ACM&rft.au=Bratley,%20P.&rft.date=1967-07-01&rft.volume=10&rft.issue=7&rft.spage=450&rft.pages=450-&rft.issn=0001-0782&rft.eissn=1557-7317&rft_id=info:doi/10.1145/363427.363465&rft_dat=%3Cacm_cross%3E363465%3C/acm_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true