Pages that link to "Item:Q1306378"
From MaRDI portal
The following pages link to A two-phase algorithm for solving a class of hard satisfiability problems (Q1306378):
Displaying 10 items.
- Filter-based resolution principle for lattice-valued propositional logic LP\((X)\) (Q867665) (← links)
- How to fake an RSA signature by encoding modular root finding as a SAT problem (Q1408375) (← links)
- Equivalent literal propagation in the DLL procedure (Q1408382) (← links)
- Equivalency reasoning to solve a class of hard SAT problems. (Q1589482) (← links)
- An improved semidefinite programming relaxation for the satisfiability problem (Q1774165) (← links)
- Recognition of tractable satisfiability problems through balanced polynomial representations (Q1962045) (← links)
- Non-clausal redundancy properties (Q2055860) (← links)
- Solving hybrid Boolean constraints in continuous space via multilinear Fourier expansions (Q2238714) (← links)
- The state of SAT (Q2643296) (← links)
- (Q2741514) (← links)
