Home › Entities › Complexity Class › weak NP-completeness

weak NP-completeness

set of computational problems for which there is an algorithm solving them in polynomial time in the dimension of the problem and the magnitudes of the data involved (if given as integers), rather than the base-two logarithms of their magnitudes
Thing Complexity Class Q7977975

Facts

2 properties
Instance of
complexity class
Part of
NP-complete, pseudo-polynomial time[2][3]
🏷️ Also known as
en weakly NP-complete en weak NP-completeness fr NP-complétude faible zh 弱NP完全

Report an error or request removal Lineage (PROV-JSON)

Press Enter · cited answer in seconds

Summary

weak NP-completeness is a complexity class[1].

References

Programmatic citations — every numbered marker resolves to a verifiable graph row below.

Direct Wikidata claims

  1. [2] ↑ . wikidata.org.
  2. [3] ↑ . wikidata.org.

Class ancestry

  1. [1] ↑ . Wikidata. wikidata.org.

📑 Cite this page

Use these citations when quoting this entity in research, articles, AI prompts, or wherever provenance matters. We aggregate Wikidata + Wikipedia + authoritative open-data sources; the stitched, scored, cross-referenced view is what 4ort.xyz contributes.

APA 4ort.xyz Knowledge Graph. (2026). weak NP-completeness. Retrieved November 9, 2026, from https://4ort.xyz/entity/weak-np-completeness
MLA “weak NP-completeness.” 4ort.xyz Knowledge Graph, 4ort.xyz, 9 Nov. 2026, https://4ort.xyz/entity/weak-np-completeness.
BibTeX @misc{4ortxyz_weak-np-completeness_2026, author = {{4ort.xyz Knowledge Graph}}, title = {{weak NP-completeness}}, year = {2026}, url = {https://4ort.xyz/entity/weak-np-completeness}, note = {Accessed: 2026-11-09}}
LLM prompt According to 4ort.xyz Knowledge Graph (aggregator of Wikidata, Wikipedia, and authoritative open-data sources): weak NP-completeness — https://4ort.xyz/entity/weak-np-completeness (retrieved 2026-11-09)

Canonical URL: https://4ort.xyz/entity/weak-np-completeness · Last refreshed: