Unverified50% confidenceOpinionExact time
To the authors' knowledge, this is the first polynomial-space algorithm with such a running time for a non-trivial dense class of Max 2-SAT instances.
1
Sources
50%
Confidence
Long-term
Relevance
10/30/2026
First Seen
Sources
Related Entities
Related Claims
UnverifiedColBERT v2 introduced vector compression technology (residual compression coding) to alleviate the storage space issues of multi-vector representations.57% similarUnverifiedThe Mersenne Twister algorithm uses a state array of 624 32-bit integers, occupying approximately 2.5 KB of memory in total.56% similarUnverified6GB显存可运行基础模型如SD 1.5，生成512×512常规尺寸图像，单张生成时间在数秒到十几秒56% similarUnverified2-bit quantization represents each parameter with 2 binary bits, achieving an 8x compression ratio compared to FP16, making it the highest compression tier among currently practical quantization methods, and it is generally only suitable for large-parameter models with redundant structures such as MoE56% similarUnverified两个 SDF 的并集、交集、差集可以通过对数值取 min/max/取反实现，无需网格裁剪56% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/1114608API
curl https://kongchang.com/api/v1/knowledge/claims/1114608MCP
get_claim(id=1114608)