{
  "id": "coppersmith93-general",
  "categoryId": "ifp-general-heuristic",
  "paperId": "coppersmith93",
  "date": "1993-03-31",
  "datePrecision": "month",
  "time": {
    "coefficient": 1.9018836118648392,
    "expression": "L_N[1/3, (92+26 sqrt(13))^{1/3}/3]"
  },
  "space": {
    "coefficient": null,
    "expression": "Not extracted from the source"
  },
  "tags": [
    "multiple number fields",
    "theoretical asymptotics"
  ],
  "review": {
    "status": "source-checked"
  },
  "certificate": {
    "status": "not-provided",
    "lean": null
  },
  "notes": "Heuristic many-polynomial/many-number-field variant; includes the first sieve/precomputation in the single-factorization cost. This theoretical asymptotic improvement is distinct from practical two-polynomial GNFS and from the separate factorization-factory regime.",
  "extra": {
    "coefficientExact": "(92+26 sqrt(13))^{1/3}/3"
  },
  "evidence": {
    "url": "https://link.springer.com/content/pdf/10.1007/BF00198464.pdf",
    "locator": "Section 3, Parameters and Running Time, pp. 176–177",
    "sourceVersion": "Version available at the cited URL; bibliographic metadata and stated bound checked on 2026-11-08"
  }
}