skip to content
Parallel algorithms for arithmetics, irreducibility and factoring of GFq-polynomials Preview this item
ClosePreview this item
Checking...

Parallel algorithms for arithmetics, irreducibility and factoring of GFq-polynomials

Author: Moshe Morgensteren; E Shamir
Publisher: Stanford, Calif. Dep. of Computer Science, Univ. 1983
Series: Report / Department of Computer Science, Stanford University, 991; Report, 991
Edition/Format:   Print book : EnglishView all editions and formats
Database:WorldCat
Rating:

(not yet rated) 0 with reviews - Be the first.

 

Find a copy in the library

&AllPage.SpinnerRetrieving; Finding libraries that hold this item...

Details

Document Type: Book
All Authors / Contributors: Moshe Morgensteren; E Shamir
OCLC Number: 257913198
Description: 10 S
Series Title: Report / Department of Computer Science, Stanford University, 991; Report, 991
Responsibility: M. Morgensteren; E. Shamir

Reviews

User-contributed reviews
Retrieving GoodReads reviews...
Retrieving DOGObooks reviews...

Tags

Be the first.
Confirm this request

You may have already requested this item. Please select Ok if you would like to proceed with this request anyway.

Linked Data


<http://www.worldcat.org/oclc/257913198>
library:oclcnum"257913198"
library:placeOfPublication
library:placeOfPublication
rdf:typeschema:Book
schema:author
schema:creator
schema:datePublished"1983"
schema:exampleOfWork<http://worldcat.org/entity/work/id/3730172>
schema:inLanguage"en"
schema:isPartOf
schema:name"Parallel algorithms for arithmetics, irreducibility and factoring of GFq-polynomials"
schema:publication
schema:publisher
wdrs:describedby

Content-negotiable representations

Close Window

Please sign in to WorldCat 

Don't have an account? You can easily create a free account.