{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:55:27Z","timestamp":1750308927278,"version":"3.41.0"},"reference-count":3,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[1984,5,1]],"date-time":"1984-05-01T00:00:00Z","timestamp":452217600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["SIGSAM Bull."],"published-print":{"date-parts":[[1984,5]]},"abstract":"<jats:p>Nature has a way of producing mathematical models to beholders with an open mind for beauty. Those models provide a challenge to explore their constructive aspects, to investigate their properties by algorithmic methods implying a way to prove them, and to using them as a basis for further experimentation.<\/jats:p>","DOI":"10.1145\/1089369.1089372","type":"journal-article","created":{"date-parts":[[2007,1,17]],"date-time":"2007-01-17T18:32:02Z","timestamp":1169058722000},"page":"8-9","update-policy":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Position statement for EUROCAL 85"],"prefix":"10.1145","volume":"18","author":[{"given":"H.","family":"Zassenhaus","sequence":"first","affiliation":[{"name":"The Ohio State University, Columbus (Ohio)"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[1984,5]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.2140\/pjm.1972.41.699"},{"volume-title":"On polynomial factorization, to appear in Proceedings of the Alberta Conference on Number Theory","year":"1983","author":"Zassenhaus Hans J","key":"e_1_2_1_2_1"},{"key":"e_1_2_1_3_1","unstructured":"Pohst Michael: An algorithmus for shortest vectors of an lattice to appear.  Pohst Michael: An algorithmus for shortest vectors of an lattice to appear."}],"container-title":["ACM SIGSAM Bulletin"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/dl.acm.org\/doi\/10.1145\/1089369.1089372","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/dl.acm.org\/doi\/pdf\/10.1145\/1089369.1089372","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T21:36:45Z","timestamp":1750282605000},"score":1,"resource":{"primary":{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/dl.acm.org\/doi\/10.1145\/1089369.1089372"}},"subtitle":["the efficiency of mathematical models"],"short-title":[],"issued":{"date-parts":[[1984,5]]},"references-count":3,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1984,5]]}},"alternative-id":["10.1145\/1089369.1089372"],"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1145\/1089369.1089372","relation":{},"ISSN":["0163-5824"],"issn-type":[{"type":"print","value":"0163-5824"}],"subject":[],"published":{"date-parts":[[1984,5]]},"assertion":[{"value":"1984-05-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}