Pith.

Data Structures and Algorithms · arXiv:2611.16814 v1 · submitted 12 Nov 2026 · 45 references

Improved Deterministic Algorithms for k-SAT: Generalization of Chains and Recurrence Proof

Binbin Cui, S. Cliff Liu, Yongrui Yu

The paper says

“We present a deterministic algorithm for 3-SAT running in 1.32736n time.”

more of the abstract

The algorithm is built on a branching-and-chain framework augmented with a polynomial-time expansion procedure that joins short chains through additional clauses to form bounded-size blocks, which impose stronger constraints on the assignment space. After branching, the algorithm chooses between derandomized local search guided by the block structure and enumeration of block assignments together with selected port variables, reducing the remaining formula to 2-SAT. A weighted analysis of branching, partial-assignment, and local-search costs, together with inductive bounds for chains and block interactions, establishes the running-time guarantee. The framework is self-contained and also offers guidance for practical SAT solver design by identifying useful clause-overlap structures and suggesting when to switch between local-search and reduction-based strategies.

from the abstract

Pith says

Machine review · deepseek-v4-flash · 13 Nov 2026 · what was read was not recorded · not checked by a person

It can be wrong. Challenge this review or reply to it.

Holds up, with conditions.

5 major objections · 12 minor

How often objections from reviews like this one are right: not yet measured

Are you an author? What you can do.

Not checked: figures, code, what the 45 references say.

The paper says, at Appendix B, Lemma B.4

The review did not quote this passage.

Pith says: Objection 1 of 5 · major

The block size cap (d ≤ 9, chains ≤ 5, v(B) ≤ 500, occurrences ≤ 332) is asserted in Lemma B.4 with a brief proof sketch. The proof relies on bounds on chain length (v(S) ≤ 100, defining occurrences ≤ 66) that are not rigorously derived from the branching algorithm's truncation rule.

more of objection 1

The paper states that these bounds depend on the specific truncation rule and the structure of chains, but the derivation is not provided. If a block could be larger than d=9, the eigenvalue bound in Lemma 3.5 (smallest eigenvalue ≥ 2^{-9}) would weaken, potentially invalidating the margin calculations that are essential to Lemma 5.8. The authors acknowledge that the block cap 'makes the relation library of DLS finite' and 'is what allows S and H to be computed before either terminal runs,' but the actual computation of these costs for all possible block types is not demonstrated. This is a load-bearing issue because the central claim depends on the existence of a feasible characteristic distribution for each block type and the lower bound λ_B ≥ (1+ε)(3/7)^{t(B)}(3/4)^{v(B)} (Lemma 3.5), which assumes d ≤ 9. The paper should provide a rigorous proof of the block size cap or a more detailed argument that the eigenvalue bound holds for all blocks that can actually be produced by the expansion procedure.

The paper says, at Appendix B, Lemma B.2 and B.3

The review did not quote this passage.

Pith says: Objection 2 of 5 · major

The proof that A(B) > 0 for all one-center and two-center blocks relies on a finite enumeration of contact geometries and certified margins. The paper states that 'the finite endpoint checks are collected in Table 3, and every entry is positive,' but Table 3 is not provided in the manuscript (the table is referenced but not included).

more of objection 2

Without the actual numerical values and the verification that all cases are covered, the proof is incomplete. The authors should include the full table or provide a more systematic argument that does not depend on an omitted table.

The paper says, at Section 5.2, Lemma 5.8

The review did not quote this passage.

Pith says: Objection 3 of 5 · major

The proof of Lemma 5.8 (nonnegative margins for all blocks and weak chains) is split between the main text and Appendix B. The main text provides the chain inequality proof using bounds on m_w from Theorem A.6 and Lemmas A.7, A.8.

more of objection 3

However, the proof that A(B) ≥ 0 for blocks is deferred to Appendix B, which relies on the block size cap and the omitted Table 3. As noted above, the block size cap is not rigorously proven, and the table is missing. Therefore, the proof of Lemma 5.8 is incomplete. The authors should either provide a complete proof of the block size cap and include the missing table, or restructure the argument to avoid reliance on these unverified components.

The paper says, at Section 3.2, Lemma 3.5

The review did not quote this passage.

Pith says: Objection 4 of 5 · major

Lemma 3.5 claims a uniform block gain λ_B ≥ (1+ε)(3/7)^{t(B)}(3/4)^{v(B)} with ε = 1/(23·2^16). The proof uses a spectral argument that assumes the smallest eigenvalue of the similarity matrix for a block is at least 2^{-9}, which holds because d ≤ 9.

more of objection 4

However, the bound d ≤ 9 depends on the block size cap (Lemma B.4), which is not rigorously proven. Additionally, the proof assumes that the block's solution space A is a strict subset of A' = A_0^t × {0,1}^v, but this relies on the existence of a 'witness' clause distinct from every source. The paper should clarify that this witness is the center clause itself, and that the inclusion is strict because the center clause is not satisfied by all assignments in A'. This is a minor point, but the reliance on the unproven block size cap is a major concern.

The paper says, at Section 6, Theorem 6.6

The review did not quote this passage.

Pith says: Objection 5 of 5 · major

The generalization to k≥4 is presented as a recurrence that depends on the 3-SAT base case c_3 = 1.3273599467... from Theorem 5.10. However, the proof of Theorem 5.10 itself depends on the unverified block size cap and the missing Table 3. Therefore, the entire generalization is contingent on the correctness of the 3-SAT analysis. The authors should either provide a complete proof for the 3-SAT case or state that the k≥4 results are conditional on the 3-SAT analysis.

12 minor objections

The paper says, at Abstract

Pith says: minor objection 1 of 12

The abstract states the running time as 1.32736^n, but Theorem 5.10 gives e^{E_t n} with e^{E_t} = 1.3273599467... The rounding to 1.32736 is acceptable, but the paper should be consistent about whether the bound is 1.32736 or 1.3273599467... in the abstract and introduction.

The paper says, at Section 1.2, Figure 1

Pith says: minor objection 2 of 12

Figure 1 is referenced but not included in the manuscript. The workflow description is clear enough without it, but the figure should be included for completeness.

show 10 more

The paper says, at Section 2.2, Definition 2.4

Pith says: minor objection 3 of 12

The definition of a block uses the term 'τ-block' but τ is not defined. It appears to be the number of clauses, but this should be clarified.

The paper says, at Section 2.5.1, Algorithm 2

Pith says: minor objection 4 of 12

In Algorithm 2, line 17: 'l←and arbitrary literal that is set to1inα prev' should be 'l←an arbitrary literal that is set to1inα prev'. Also, line 18: 'C←and arbitrary clause' should be 'C←an arbitrary clause'.

The paper says, at Section 3.1, Algorithm 4

Pith says: minor objection 5 of 12

Algorithm 4 (Simple-Expansion) uses the notation 'I_1-chain' but the variable is named 'I_1-chain' in the algorithm and 'I_{1-chain}' in the text. This should be consistent.

The paper says, at Section 3.2, Lemma 3.4

Pith says: minor objection 6 of 12

The proof of Lemma 3.4 uses the bound ν_1 ≤ n log c^* / log 3 + O(1). This relies on the assumption that all chains are 1-chains, which is stated in the algorithm description. However, the bound should be justified more explicitly, perhaps by referencing the branching cost formula.

The paper says, at Section 5.1.1

Pith says: minor objection 7 of 12

The branching cost for a chain S is given as b(S) = 2^{N_p(S)} 3^{1+N_n(S)} (7/3)^{N_t(S)}. The factor 2^{N_p(S)} should be 2^{N_p(S)}? Actually, from Table 2, p has branch number 2, so it should be 2^{N_p(S)}. The text says '2^{N_p(S)}' but the exponent is not clearly formatted. Please ensure the formula is correctly typeset.

The paper says, at Section 5.2, Lemma 5.8

Pith says: minor objection 8 of 12

The proof of Lemma 5.8 for chains uses the bounds on m_w from Theorem A.6 and Lemmas A.7, A.8. The numerical values for m_n, m_p, m_t are given as 173/99, 79/45, 25/19. However, these are fractions that should be simplified or given as decimals for clarity. Also, the margin increments Δ_n, Δ_p, Δ_t are computed as positive, but the numerical values (0.00142, 0.00157, 0.00044, 0.00467) seem to have four values for three increments. Please check the arithmetic.

The paper says, at Appendix A, Lemma A.5

Pith says: minor objection 9 of 12

The fiber-extension identity (7) is a key lemma. The proof sketch is brief; it would be helpful to include a more detailed derivation, perhaps showing the substitution step explicitly.

The paper says, at Appendix B, Lemma B.1

Pith says: minor objection 10 of 12

The lemma statement is incomplete: 'A(B)≥ ...' is given but the right-hand side is not fully displayed. The proof says 'By Equation 11 and 12, the conclusion follows by collecting terms.' This is insufficient; the derivation should be shown.

The paper says, at Appendix B, Table 3

Pith says: minor objection 11 of 12

Table 3 is referenced but not included. This is a critical omission because the proof of Lemma B.2 relies on it. The authors should either include the table or provide an alternative argument.

The paper says, at General

Pith says: minor objection 12 of 12

The paper contains several typographical errors and awkward phrasings (e.g., 'the algorithm chooses between derandomized local search guided by the block structure and enumeration of block assignments together with selected port variables, reducing the remaining formula to 2-SAT'). A thorough proofreading is recommended.

What would settle it

Independently enumerate all possible block types that can arise from the expansion procedure (Algorithm 7) under the stated truncation rule, and verify that each satisfies d ≤ 9. If any block type has d > 9, recompute the smallest eigenvalue of its similarity matrix; if the eigenvalue falls below 2^{-9}, check whether the margin A(B) remains nonnegative under the weaker bound. This test would settle whether the spectral argument in Lemma 3.5 is sound for all blocks the algorithm can produce.

from the skeptic's reading

How the review went

3 readings by deepseek-v4-flash · 13 Nov 2026

  1. Reader holds up, with conditions confidence moderate
  2. Skeptic agrees 9 s · 31,490 tokens read, 785 written
  3. Referee major revision: 5 major objections, 12 minor 17 s · 31,979 tokens read, 2,517 written

Not run on this paper: the editor, the simulated authors' defence.

Pith did not check this review's objections against the paper.

The review in full

The strongest objection

The central claim of a 1.32736^n deterministic 3-SAT algorithm depends on the existence of a feasible characteristic distribution for each block type and the lower bound λ_B ≥ (1+ε)(3/7)^{t(B)}(3/4)^{v(B)} (Lemma 3.5). This bound is derived from a spectral argument that assumes the smallest eigenvalue of the similarity matrix for a block is at least 2^{-9}, which holds because the block size is bounded (d ≤ 9). The bound on block size (d ≤ 9) is asserted in Lemma B.4: "Every block B ∈ I satisfies #{chains in B} ≤ 5, v(B) ≤ 500, #{defining and center occurrences} ≤ 332." The proof of Lemma B.4 is given in a single paragraph that sketches a counting argument but does not provide a rigorous derivation from the algorithm's expansion procedure. The argument assumes that each chain has at most 66 defining occurrences and at most 100 variables, but these bounds themselves depend on the specific truncation rule and the structure of chains produced by the branching algorithm, which are not fully analyzed. Moreover, the paper states that the block cap "makes the relation library of DLS finite" and "is what allows S and H to be computed before either terminal runs," but the actual computation of these costs for all possible block types is not demonstrated. If a block could be larger than d=9, the eigenvalue bound would weaken, potentially invalidating the margin calculations that are essential to the proof that A(B) ≥ 0 for all blocks (Lemma 5.8). The paper acknowledges that the characteristic distribution may have negative entries (Appendix A.4: "its entries need not be nonnegative"), which would make Liu's equality-based characteristic condition infeasible, but then relies on a weaker lower-bound condition (Lemma A.9) that still requires the eigenvalue bound. The entire edifice of the improved bound rests on this eigenvalue argument, and the block-size cap is not rigorously justified.

The reader's weakest_assumption correctly identifies that the bound on block size (d ≤ 9) is critical and that its proof relies on a finite but complex combinatorial check. The paper's own Lemma B.4 is asserted in a single paragraph without a rigorous derivation, and the subsequent analysis depends on this cap. The reader's verdict of CONDITIONAL is appropriate because the central claim is likely correct but the proof has a gap that should be addressed. My stress-test confirms this: the block-size cap is the most load-bearing concern, and the concrete test I propose would directly address it. I agree with the reader's assessment.

The referee's report

If the result holds, it provides the fastest known deterministic algorithm for 3-SAT, improving a bound that has stood for several years. The techniques—chains, blocks, expansion, and the weighted analysis—are novel and may be applicable to other constraint satisfaction problems. The paper also offers a self-contained framework and provides guidance for practical SAT solver design. The improvement is numerically modest but strict, and the approach is promising for further optimization.

Pith's reading of the paper (a machine's summary, not the authors')

The paper tackles the Boolean satisfiability problem (SAT) for formulas with at most three literals per clause (3-SAT). It builds on a prior algorithm by Liu that uses a branching procedure to either solve the formula directly or produce a set of 'chains' (sequences of overlapping clauses). These chains help a derandomized local search (DLS) procedure by restricting the search space. The key new idea is an 'expansion' step that runs after branching. It takes short chains (which provide weak constraints) and connects them using additional clauses from the original formula to form larger 'blocks'. Blocks have more complex overlap patterns and therefore impose stronger constraints on the search space. The algorithm then chooses between two strategies: either use the blocks to make DLS more efficient, or enumerate assignments to the blocks and some extra variables to reduce the remaining formula to a 2-SAT instance (which is solvable in polynomial time). The analysis uses a weighted combination of the costs of branching, partial assignment enumeration, and DLS to prove the overall running time bound. The improvement over Liu's bound is numerically modest (from 1.32793^n to 1.32736^n) but represents a strict improvement. The paper also generalizes the approach to k-SAT for k>=4, obtaining improved bounds for those cases as well.

Core claim. The paper claims a deterministic algorithm for 3-SAT running in time O(1.32736^n), improving the previous best bound of 1.32793^n by Liu. (Abstract, Theorem 4.1, Theorem 5.10)

The premise it rests on. The analysis relies on the existence of a feasible characteristic distribution for each block type, and the assumption that the characteristic values λ_B satisfy the lower bound λ_B >= (1+ε)(3/7)^t(B) (3/4)^v(B) (Lemma 3.5). This bound is derived from a spectral argument that assumes the smallest eigenvalue of the similarity matrix for a block is at least 2^{-9}, which holds because the block size is bounded (d <= 9). However, the bound on block size (d <= 9) depends on the specific expansion procedure and the assumption that each block contains at most 5 chains and 2 center clauses (Lemma B.4). If a block could be larger, the eigenvalue bound would weaken, potentially invalidating the margin calculations. The paper asserts this bound is proven in Appendix B, but the proof relies on enumerating all possible block types and checking each case, which is a finite but complex combinatorial check.

Check this review

Pith stored no record of this review's passes and took no fingerprint of it. Reviews made by code from 13 Nov 2026 on carry both.

How often reviews like this one are right

Reviews like this one: written by deepseek-v4-flash, where what was read was not recorded.

How often objections from reviews like this one are right: not yet measured

Every value above, in the review's public record (JSON)

Reviews by people

This review was written by a machine. No person has reviewed this paper on Pith yet. A scientist listed on Pith can review it for a fee, and their review is published here whatever it concludes.

Request a human review

How Pith checks papers · The full audit of this paper

The paper

Abstract

We present a deterministic algorithm for 3-SAT running in 1.32736n time. The algorithm is built on a branching-and-chain framework augmented with a polynomial-time expansion procedure that joins short chains through additional clauses to form bounded-size blocks, which impose stronger constraints on the assignment space. After branching, the algorithm chooses between derandomized local search guided by the block structure and enumeration of block assignments together with selected port variables, reducing the remaining formula to 2-SAT. A weighted analysis of branching, partial-assignment, and local-search costs, together with inductive bounds for chains and block interactions, establishes the running-time guarantee. The framework is self-contained and also offers guidance for practical SAT solver design by identifying useful clause-overlap structures and suggesting when to switch between local-search and reduction-based strategies.

The paper's own sentences, arranged, kept beside the review and separate from it. Each label is drawn from a closed vocabulary; the number beside it is the probability the classifier gave that label. No sentence in this record was written by a model.

abstract compiled · 2026-11-13

The authors' main claim, as the classifier picked it out 1.00

“We present a deterministic algorithm for 3-SAT running in $1.32736^n$ time.”

How the main claim is stated: asserted 1.00

What the abstract itself states, as probabilities: claims first 0.04 · states limitation 0.08 · human participants 0.01 · controlled comparison 0.02 · randomized assignment 0.05 · states quantitative result 0.99 · compares with prior results 0.09 · mentions code or data availability 0.02

The abstract, sentence by sentence

This table labels the abstract only (arXiv listing abstract v1). The number is the probability the classifier gave the label.

SentenceRoleThe authors' own workStates the main conclusionStrength
We present a deterministic algorithm for 3-SAT running in $1.32736^n$ time. contribution 0.55 0.95 0.86 asserted 1.00
The algorithm is built on a branching-and-chain framework augmented with a polynomial-time expansion procedure that joins short chains through additional clauses to form bounded-size blocks, which impose stronger constraints on the assignment space. method 0.98 0.89 0.07 asserted 1.00
After branching, the algorithm chooses between derandomized local search guided by the block structure and enumeration of block assignments together with selected port variables, reducing the remaining formula to 2-SAT. method 1.00 0.87 0.07 asserted 1.00
A weighted analysis of branching, partial-assignment, and local-search costs, together with inductive bounds for chains and block interactions, establishes the running-time guarantee. method 0.81 0.92 0.17 asserted 1.00
The framework is self-contained and also offers guidance for practical SAT solver design by identifying useful clause-overlap structures and suggesting when to switch between local-search and reduction-based strategies. interpretation 0.87 0.71 0.08 asserted 0.76

What kind of paper the classifier reports this is: method or tool 0.94 · evidence from proof or derivation 1.00

What was examined, and what was not

Sources read

  • arXiv listing abstract v1

Not examined

  • full text
  • figures and tables
  • references and citing sentences
  • relations to other papers

Levels run

  • P abstract

Not run

  • S sections
  • T body sentences
  • C citations
  • R cross-paper relations

How the labels were made

Compiled by classifier-1.13.0 via TypeSafe API, question bank abstract-p1-20260923, 2026-11-13: 1 request, 4,327 input tokens.

Every quoted sentence on this record is the authors'. Every label is from Pith's closed vocabulary, with the probability shown beside it. This record as JSON

Figures (3)
Figure 1 of the paper
Figure 1. The workflow of the algorithm of Liu unlike the disjoint clauses used by HSSW, a chain can capture insightful structure among overlapping clauses. Overlap relations between clauses in a chain restrict the search space of derandomized local search to a proper subset of the Cartesian product of the individual clause solution spaces. Because of the overlapping, the solution space of a chain is smaller than the product of the solution spaces of its individual clauses. Liu restricts the search space of derandomized local search in the product of the solution space of every constructed…
Figure 2 of the paper
Figure 2. The workflow of our algorithm C1 C2 C3 C4 C5 (a) Chain C1 C2 C3 C4 C5 C6 C7 (b) Block
Figure 3 of the paper
Figure 3. Schematic clause-overlap structures for chains and blocks. Each vertex is a clause, and

Figures are the authors', reproduced from the paper.

References (45)
  1. [1] A linear-time algorithm for testing the truth of certain quantified boolean formulas , author=. Information Processing Letters , volume=. 1979 , publisher= on Pith
  2. [2] Timon Hertli , title =. SIAM Journal on Computing , volume =. 2014 , doi = on Pith
  3. [3] A Probabilistic 3-SAT Algorithm Further Improved , author=. 19th Annual Symposium on Theoretical Aspects of Computer Science, STACS 2002 , pages=. 2002 , publisher= on Pith
  4. [4] Ramamohan Paturi and Pavel Pudl. An Improved Exponential-Time Algorithm for. Journal of the ACM , volume =. 2005 , doi = on Pith
  5. [5] Rolf, Daniel , journal=. Improved bound for the PPSZ/Sch on Pith
  6. [6] Improved upper bounds for 3-SAT , author=. Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2004 , volume= on Pith
  7. [7] Improving a probabilistic 3-SAT algorithm by dynamic search and independent clause pairs , author=. Theory and Applications of Satisfiability Testing , pages=. 2004 , organization= on Pith
  8. [8] Improving PPSZ for 3-SAT using critical variables , author=. arXiv preprint arXiv:1009.4830 , year= on PithPith's reviewarXiv
  9. [9] Uwe Sch. A Probabilistic Algorithm for k-SAT and Constraint Satisfaction Problems , booktitle = on Pith
  10. [10] Evgeny Dantsin and Andreas Goerdt and Edward A. Hirsch and Ravi Kannan and Jon Kleinberg and Christos Papadimitriou and Prabhakar Raghavan and Uwe Sch. A Deterministic. Theoretical Computer Science , volume =. 2002 , doi = on Pith
  11. [11] Robin A. Moser and Dominik Scheder , title =. Proceedings of the 43rd Annual ACM Symposium on Theory of Computing , pages =. 2011 , doi = on Pith
  12. [12] Tobias Br. An improved deterministic local search algorithm for 3-SAT , journal = on Pith
  13. [13] Daniel Rolf , title =. Theory and Applications of Satisfiability Testing, 8th International Conference, on Pith
  14. [14] Kazuhisa Makino and Suguru Tamaki and Masaki Yamamoto , title =. Algorithmica , volume =. 2013 , doi = on Pith
  15. [15] A computing procedure for quantification theory , author=. Journal of the ACM (JACM) , volume=. 1960 , publisher= on Pith
  16. [16] On 2-SAT and renamable Horn , author=. Proceedings of the National Conference on Artificial Intelligence , pages=. 2000 , organization= on Pith
  17. [17] A machine program for theorem-proving , author=. Communications of the ACM , volume=. 1962 , publisher= on Pith
  18. [18] Solving satisfiability in less than 2^n steps , author=. Discrete Applied Mathematics , volume=. 1985 , publisher= on Pith
  19. [19] Daniel Rolf , title =. Electronic Colloquium on Computational Complexity. 2003 , url = on Pith
  20. [20] Oliver Kullmann , title =. Theoretical Computer Science , volume = on Pith
show 25 more
  1. [21] Solving 3-satisfiability in less than 1.579^n steps , author=. Computer Science Logic , pages= on Pith
  2. [22] Bart Selman and Henry A. Kautz and Bram Cohen , title =. Proceedings of the 12th National Conference on Artificial Intelligence , pages = on Pith
  3. [23] Sixue Liu and Periklis A. Papakonstantinou , title =. Proceedings of the Thirtieth on Pith
  4. [24] Towards the Derandomization of the PPSZ algorithm for the Multiple Satisfying Assignments Case , author=. ETH-Z\" on Pith
  5. [25] Uwe Sch. A Probabilistic Algorithm for k -SAT Based on Limited Local Search and Restart , journal = on Pith
  6. [26] Oliver Kullmann , title =. Discrete Applied Mathematics , volume = on Pith
  7. [27] Edward A. Hirsch and Arist Kojevnikov , title =. Ann. Math. Artif. Intell. , volume = on Pith
  8. [28] Hardy, Godfrey H and Ramanujan, Srinivasa , journal=. Asymptotic formula. 1918 , publisher= on Pith
  9. [29] Dominik Scheder , title =. the 3rd Latin American Theoretical Informatics Symposium, LATIN 2008 , pages = on Pith
  10. [30] Hans Kleine. Minimal Unsatisfiability and Autarkies , booktitle =. 2009 , crossref = on Pith
  11. [31] S. Cliff Liu , title =. 45th International Colloquium on Automata, Languages, and Programming,. 2018 , url =. doi:10.4230/LIPIcs.ICALP.2018.88 , timestamp = on Pithdoi:10.4230/lipics.icalp.2018.88
  12. [32] S. Cliff Liu , title =. CoRR , volume =. 2020 , url = on Pith
  13. [33] The Curse and Blessing of Not-All-Equal in k-Satisfiability , author=. CoRR , volume =. 2018 , url = on Pith
  14. [34] Thomas Dueholm Hansen and Haim Kaplan and Or Zamir and Uri Zwick , title =. Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing , pages =. 2019 , doi = on Pith
  15. [35] Tong Qin and Osamu Watanabe , title =. IEICE Transactions on Information and Systems , volume =. 2022 , doi = on Pith
  16. [36] Dominik Scheder , title =. TheoretiCS , volume =. 2024 , doi = on Pith
  17. [37] Dominik Scheder , title =. 2022 , eprint = on Pith
  18. [38] Dominik Scheder and John Steinberger , title =. Computational Complexity , volume =. 2024 , doi = on Pith
  19. [39] Tao Jiang and Shaowei Cai , title =. 2026 , eprint =. doi:10.48550/arXiv.2607.10697 , url = on PithPith's reviewarXivdoi:10.48550/arxiv.2607.10697
  20. [40] The Exponential Time Hypothesis Is False , year = on Pith
  21. [41] Ans. The Community Structure of. Theory and Applications of Satisfiability Testing -- SAT 2012 , series =. 2012 , doi = on Pith
  22. [42] Ans. Using Community Structure to Detect Relevant Learnt Clauses , booktitle =. 2015 , doi = on Pith
  23. [43] Xu, Lin and Hutter, Frank and Hoos, Holger H. and Leyton-Brown, Kevin , title =. Journal of Artificial Intelligence Research , volume =. 2008 , doi = on Pith
  24. [44] Audemard, Gilles and Lagniez, Jean-Marie and Mazure, Bertrand and Sa. Integrating Conflict Driven Clause Learning to Local Search , booktitle =. 2009 , doi = on Pith
  25. [45] Cai, Shaowei and Zhang, Xindi , title =. Theory and Applications of Satisfiability Testing -- SAT 2021 , series =. 2021 , doi = on Pith

Challenges and discussion

Disagree with the review, or know something it missed? Leave a comment, or challenge this review formally: a challenge becomes a permanent entry in this paper's record, and its decision is published here.

No comments yet.

Sign in to comment