Skip to content
ScoreQuant
Get startedWalkthroughsResearchReference
ResearchExploreLiteratureFrontier
Research tools
GraphClaims registryCounterexamplesMachine-checkedLibrary mappingHow to read

Carstensen

The sources this bibliography records under this name, in order of publication, and the claims they support.

  • Carstensen (1983)Complexity of some parametric integer and network programming problems1983Vector quantization and Voronoi theory

Claims that cite this work

  • Verification recordPublication-grade audit of the DS19 tilt-DP certificate complexAUDIT-DS-PRACTICAL-CERTIFIED-SOLVER
  • OpenExact bit complexity of the variable-dimension tilt-DP dualOPEN-DS-TILT-DUAL-EXACT-COMPLEXITY
ScoreQuant

Hard bins, and a measurement of what the binning cost.

LearnGet startedWalkthroughsResearch
ReferenceDocumentationGitHub
Open source · research provenance is explicit · no browser data leaves your device