TSAT algorithm triples tractable sizes for hardest random 3-SAT instances by actively targeting clause-type distributions in local search.
Lucas, Frontiers in Physics2, 5 (2014)
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2representative citing papers
Ground-state phase reconstruction for Heisenberg antiferromagnets with fixed amplitudes is equivalent to weighted Max-Cut on the Hilbert-space graph, establishing worst-case NP-hardness.
citing papers explorer
-
Targeting Clause Type Distributions: a Picklock for Random Satisfiability Problems
TSAT algorithm triples tractable sizes for hardest random 3-SAT instances by actively targeting clause-type distributions in local search.
-
Graph-Theoretic Analysis of Phase Optimization Complexity in Variational Wave Functions for Heisenberg Antiferromagnets
Ground-state phase reconstruction for Heisenberg antiferromagnets with fixed amplitudes is equivalent to weighted Max-Cut on the Hilbert-space graph, establishing worst-case NP-hardness.