IMSc Library catalog › Details for: Primality Testing in Polynomial Time: from randomized algorithms to Primes is in P

Normal view MARC view ISBD view

Primality Testing in Polynomial Time: from randomized algorithms to Primes is in P

By: Dietzfelbinger, MartinMaterial type: Text

TextSeries: Lecture notes in computer science ; 03000Publication details: Berlin ; springer ; 2004Description: 147ISBN: 3540403442

Item type:

BOOKS

Tags from this library: No tags from this library for this title. Log in to add tags.

Average rating: 0.0 (0 votes)

Current library	Home library	Call number	Materials specified	Status	Date due	Barcode
IMSc Library	IMSc Library	681 LNCS (Browse shelf (Opens below))		Available		52541

Previous								Next
Previous	681 LNCS Automated Reasoning: second international joint conference, IJCAR 2004 Cork, Ireland, July 4-8, 2004: proceedings	681 LNCS Lectures on Concurrency and Petri Nets: advances in petri nets	681 LNCS Objects Agents and Features: international seminar Dagstuhl Castle, Germany, February 16-21, 2003: revised and invited papers	681 LNCS Primality Testing in Polynomial Time: from randomized algorithms to Primes is in P	681 LNCS Fast software encryption: 11th international workshop, FSE 2004, Delhi, India, February 5-7, 2004, revised papers	681 LNCS Validation of stochastic systems: guide to current research	681 LNCS Logic versus approximation: essays dedicated to Michael M. Richter on the occasion of his 65th birthday	Next

There are no comments on this title.

to post a comment.