Pages that link to "Item:Q2818017"

The following pages link to Solving and Verifying the Boolean Pythagorean Triples Problem via Cube-and-Conquer (Q2818017):

Displaying 50 items.

• Optimal-depth sorting networks (Q340576) (← links)
• A nonexistence certificate for projective planes of order ten with weight 15 codewords (Q780361) (← links)
• Online over time processing of combinatorial problems (Q1617394) (← links)
• Optimal bounds for the no-show paradox via SAT solving (Q1680092) (← links)
• Ramsey properties of nonlinear Diophantine equations (Q1684657) (← links)
• How to get more out of your oracles (Q1687729) (← links)
• Formally proving size optimality of sorting networks (Q1694569) (← links)
• Near-optimal lower bounds on regular resolution refutations of Tseitin formulas for all constant-degree graphs (Q1983330) (← links)
• Optimal symmetry breaking for graph problems (Q2009225) (← links)
• Rado's criterion over squares and higher powers (Q2031686) (← links)
• A flexible proof format for SAT solver-elaborator communication (Q2044190) (← links)
• Non-clausal redundancy properties (Q2055860) (← links)
• Covered clauses are not propagation redundant (Q2096437) (← links)
• Preprocessing of propagation redundant clauses (Q2104502) (← links)
• Say no to case analysis: automating the drudgery of case-based proofs (Q2117657) (← links)
• Deep cooperation of CDCL and local search for SAT (Q2118286) (← links)
• Investigating the existence of Costas Latin squares via satisfiability testing (Q2118308) (← links)
• XOR local search for Boolean Brent equations (Q2118332) (← links)
• Inductive logic programming at 30 (Q2127222) (← links)
• Simulating strong practical proof systems with extended resolution (Q2209554) (← links)
• New ways to multiply \(3 \times 3\)-matrices (Q2229749) (← links)
• \texttt{cake\_lpr}: verified propagation redundancy checking in CakeML (Q2233509) (← links)
• On propositional coding techniques for the distinguishability of objects in finite sets (Q2272883) (← links)
• The SAT+CAS method for combinatorial search with applications to best matrices (Q2294574) (← links)
• Strong extension-free proof systems (Q2303251) (← links)
• Applying computer algebra systems with SAT solvers to the Williamson conjecture (Q2307627) (← links)
• Formally verifying the solution to the Boolean Pythagorean triples problem (Q2323449) (← links)
• Combining SAT solvers with computer algebra systems to verify combinatorial conjectures (Q2360872) (← links)
• Functional Encryption for Inner Product with Full Function Privacy (Q2798775) (← links)
• Computing Maximum Unavoidable Subgraphs Using SAT Solvers (Q2818013) (← links)
• Incompleteness, Undecidability and Automated Proofs (Q2829997) (← links)
• DRAT Proofs for XOR Reasoning (Q2835888) (← links)
• Truth Assignments as Conditional Autarkies (Q3297584) (← links)
• Nonexistence Certificates for Ovals in a Projective Plane of Order Ten (Q5041183) (← links)
• (Q5094131) (← links)
• Finding Effective SAT Partitionings Via Black-Box Optimization (Q5153508) (← links)
• Finding the Hardest Formulas for Resolution (Q5154766) (← links)
• (Q5383241) (← links)
• A Safe Computational Framework for Integer Programming Applied to Chvátal’s Conjecture (Q5883707) (← links)
• A proof system for graph (non)-isomorphism verification (Q5883756) (← links)
• The resolution of Keller's conjecture (Q5918545) (← links)
• The resolution of Keller's conjecture (Q5970770) (← links)
• Preprocessing of propagation redundant clauses (Q6053844) (← links)
• Additive averages of multiplicative correlation sequences and applications (Q6113033) (← links)
• Square Coloring Planar Graphs with Automatic Discharging (Q6141869) (← links)
• Computer-aided constructions of commafree codes (Q6156641) (← links)
• Propositional proof skeletons (Q6535365) (← links)
• Unsatisfiability proofs for distributed clause-sharing SAT solvers (Q6535367) (← links)
• Maker-breaker Rado games for equations with radicals (Q6542800) (← links)
• Without loss of satisfaction (Q6605336) (← links)