The following pages link to Vijay Ganesh (Q526761):
Displayed 36 items.
- Z3str2: an efficient solver for strings, regular expressions, and length constraints (Q526767) (← links)
- A nonexistence certificate for projective planes of order ten with weight 15 codewords (Q780361) (← links)
- An SMT solver for regular expressions and linear arithmetic over string length (Q832270) (← links)
- Machine learning-based restart policy for CDCL SAT solvers (Q1656568) (← links)
- An empirical study of branching heuristics through the lens of global learning rate (Q1680251) (← links)
- The satisfiability of word equations: decidable and undecidable theories (Q1798903) (← links)
- On the hierarchical community structure of practical Boolean formulas (Q2118321) (← links)
- String theories involving regular membership predicates: from practice to theory and back (Q2140459) (← links)
- Complex Golay pairs up to length 28: a search via computer algebra and programmatic SAT (Q2200304) (← links)
- The SAT+CAS method for combinatorial search with applications to best matrices (Q2294574) (← links)
- Applying computer algebra systems with SAT solvers to the Williamson conjecture (Q2307627) (← links)
- Combining SAT solvers with computer algebra systems to verify combinatorial conjectures (Q2360872) (← links)
- Community and LBD-based clause sharing policy for parallel SAT solving (Q2661331) (← links)
- Towards a complexity-theoretic understanding of restarts in SAT solvers (Q2661349) (← links)
- Towards more efficient methods for solving regular-expression heavy string constraints (Q2680985) (← links)
- Learning Rate Based Branching Heuristic for SAT Solvers (Q2818006) (← links)
- MathCheck2: A SAT+CAS Verifier for Combinatorial Conjectures (Q2829996) (← links)
- Impact of Community Structure on SAT Solver Performance (Q3192075) (← links)
- SATGraf: Visualizing the Evolution of SAT Formula Structure in Solvers (Q3453211) (← links)
- MathCheck: A Math Assistant via a Combination of Computer Algebra Systems and SAT Solvers (Q3454125) (← links)
- (Q4417953) (← links)
- (Q4427903) (← links)
- On the Unreasonable Effectiveness of SAT Solvers (Q5027291) (← links)
- Nonexistence Certificates for Ovals in a Projective Plane of Order Ten (Q5041183) (← links)
- Enumeration of Complex Golay Pairs via Programmatic SAT (Q5120185) (← links)
- New Infinite Families of Perfect Quaternion Sequences and Williamson Sequences (Q5138930) (← links)
- A Decision Procedure for Bit-Vectors and Arrays (Q5429343) (← links)
- The proof complexity of SMT solvers (Q6039408) (← links)
- Machine learning and logic: a new frontier in artificial intelligence (Q6056641) (← links)
- Diversifying a parallel SAT solver with Bayesian moment matching (Q6168990) (← links)
- (Q6190877) (← links)
- Interpolating strong induction (Q6194955) (← links)
- A SAT+CAS Approach to Finding Good Matrices: New Examples and Counterexamples (Q6309599) (← links)
- SAT Solvers and Computer Algebra Systems: A Powerful Combination for Mathematics (Q6321832) (← links)
- Unsatisfiability Proofs for Weight 16 Codewords in Lam's Problem (Q6333896) (← links)
- A SAT-based Resolution of Lam's Problem (Q6355609) (← links)