An efficient algorithm recovers phylogenetic trees from Θ(n) noisy quartets under random classification noise, matching the information-theoretic lower bound and achieving near-optimal quartet distance.
The Satisfiability Threshold of Random 3-SAT Is at Least 3.52
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
abstract
We prove that a random 3-SAT instance with clause-to-variable density less than 3.52 is satisfiable with high probability. The proof comes through an algorithm which selects (and sets) a variable depending on its degree and that of its complement.
verdicts
UNVERDICTED 3representative citing papers
Triplet constraints realizable in D-dimensional Euclidean space cannot be preserved above 50% accuracy by any embedding of dimension at most cD for constant c<1, with UGC-hardness preventing better polynomial-time solutions in any dimension.
Computational phase transitions in decision problems exhibit a detectable signature in Gibbs distributions that can be observed in physical annealing processors.
citing papers explorer
-
Optimal Phylogenetic Reconstruction from Sampled Quartets
An efficient algorithm recovers phylogenetic trees from Θ(n) noisy quartets under random classification noise, matching the information-theoretic lower bound and achieving near-optimal quartet distance.
-
Provable Accuracy Collapse in Embedding-Based Representations under Dimensionality Mismatch
Triplet constraints realizable in D-dimensional Euclidean space cannot be preserved above 50% accuracy by any embedding of dimension at most cD for constant c<1, with UGC-hardness preventing better polynomial-time solutions in any dimension.
-
Computational Phase Transition Signature in Gibbs Sampling
Computational phase transitions in decision problems exhibit a detectable signature in Gibbs distributions that can be observed in physical annealing processors.