{"@context":["https://w3id.org/fdo/context/v1",{"schema":"https://schema.org/","prov":"http://www.w3.org/ns/prov#","fdo":"https://w3id.org/fdo/vocabulary/"}],"@id":"https://fdo.portal.mardi4nfdi.de/fdo/Q3597983","@type":"DigitalObject","kernel":{"@id":"https://fdo.portal.mardi4nfdi.de/fdo/Q3597983","digitalObjectType":"https://schema.org/ScholarlyArticle","primaryIdentifier":"mardi:Q3597983","kernelVersion":"v1","immutable":true,"modified":"2026-01-14T09:30:18Z"},"profile":{"@context":"https://schema.org","@type":"ScholarlyArticle","@id":"https://portal.mardi4nfdi.de/entity/Q3597983","name":"Computing the Greatest Common Divisor of Polynomials Using the Comrade Matrix","headline":"Computing the Greatest Common Divisor of Polynomials Using the Comrade Matrix","description":"scientific article; zbMATH DE number 5500472","url":"https://portal.mardi4nfdi.de/entity/Q3597983","datePublished":"2009-01-29","author":[{"@id":"https://portal.mardi4nfdi.de/entity/Q1760572"},{"@id":"https://portal.mardi4nfdi.de/entity/Q3597982"}],"publisher":[{"@id":"https://portal.mardi4nfdi.de/entity/Q2799546"}],"identifier":{"@type":"PropertyValue","propertyID":"doi","value":"10.1007/978-3-540-87827-8_7","url":"https://doi.org/10.1007/978-3-540-87827-8_7"},"sameAs":["https://doi.org/10.1007/978-3-540-87827-8_7"],"citation":[{"@id":"https://portal.mardi4nfdi.de/entity/Q1226148"},{"@id":"https://portal.mardi4nfdi.de/entity/Q1251704"},{"@id":"https://portal.mardi4nfdi.de/entity/Q3309525"},{"@id":"https://portal.mardi4nfdi.de/entity/Q800983"},{"@id":"https://portal.mardi4nfdi.de/entity/Q5633583"},{"@id":"https://portal.mardi4nfdi.de/entity/Q4776833"},{"@id":"https://portal.mardi4nfdi.de/entity/Q3316586"},{"@id":"https://portal.mardi4nfdi.de/entity/Q2958970"},{"@id":"https://portal.mardi4nfdi.de/entity/Q5180761"},{"@id":"https://portal.mardi4nfdi.de/entity/Q4139557"},{"@id":"https://portal.mardi4nfdi.de/entity/Q4445005"}]},"provenance":{"prov:generatedAtTime":"2026-01-14T09:30:18Z","prov:wasAttributedTo":"MaRDI Knowledge Graph"}}