Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

"Primality Testing in Polynomial Time, From Randomized Algorithms to ..."

Martin Dietzfelbinger (2004)

> Home

Details and statistics

DOI: 10.1007/B12334

access: closed

type: Book or Thesis

metadata version: 2019-05-14

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - books/sp/Dietzfelbinger04
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/books/sp/Dietzfelbinger04
Martin Dietzfelbinger:
Primality Testing in Polynomial Time, From Randomized Algorithms to "PRIMES Is in P". Lecture Notes in Computer Science 3000, Springer 2004, ISBN 3-540-40344-2

a service of

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.