Format:
Online-Ressource
Note:
Jena, Univ., Habil.-Schr., 1999
Additional Edition:
Druckausg. Rothe, Jörg, 1966- Complexity of certificates, heuristics, and counting types, with applications to cryptography and circuit theory
Language:
English
Keywords:
Berechnungskomplexität
;
NP-vollständiges Problem
;
Hochschulschrift
URN:
urn:nbn:de:gbv:27-20060809-125621-1
URL:
https://nbn-resolving.org/urn:nbn:de:gbv:27-20060809-125621-1
URL:
https://d-nb.info/982741014/34