Triple
T2002192
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Daniel J. Bernstein |
E43494
|
entity |
| Predicate | thesisTitle |
P1860
|
FINISHED |
| Object |
Computing short vectors in lattices
"Computing short vectors in lattices" is Daniel J. Bernstein's doctoral thesis, focusing on algorithms and complexity issues related to finding short vectors in mathematical lattices, a central problem in computational number theory and cryptography.
|
E224030
|
NE FINISHED |
Provenance (5 batches)
| Stage | Batch ID | Job type | Status |
|---|---|---|---|
| creating | batch_69a88715dbbc8190b2299e29e955d997 |
elicitation | completed |
| NER | batch_69abb8820cec8190a945e5daeb8c9df6 |
ner | completed |
| NED1 | batch_69ae0342ef8c8190b7771076282981c3 |
ned_source_triple | completed |
| NED2 | batch_69ae0751eff4819086e5469a2c56a24d |
ned_description | completed |
| NEDg | batch_69ae057cc1a08190895031fa6c095f49 |
nedg | completed |
Created at: March 4, 2026, 7:37 p.m.