Pages that link to "Item:Q1581847"
From MaRDI portal
The following pages link to New worst-case upper bounds for SAT (Q1581847):
Displayed 22 items.
- Improving exact algorithms for MAX-2-SAT (Q812398) (← links)
- An improved upper bound for SAT (Q820534) (← links)
- An improved exact algorithm for the domatic number problem (Q845906) (← links)
- An efficient fixed-parameter algorithm for 3-hitting set (Q876698) (← links)
- Bounded list injective homomorphism for comparative analysis of protein-protein interaction graphs (Q935835) (← links)
- An algorithm for exact satisfiability analysed with the number of clauses as parameter (Q1045885) (← links)
- Worst-case upper bounds for MAX-2-SAT with an application to MAX-CUT. (Q1408377) (← links)
- Worst-case study of local search for MAX-\(k\)-SAT. (Q1408379) (← links)
- Lean clause-sets: Generalizations of minimally unsatisfiable clause-sets (Q1408381) (← links)
- A deterministic \((2-2/(k+1))^{n}\) algorithm for \(k\)-SAT based on local search. (Q1853552) (← links)
- A tighter upper bound for random MAX \(2\)-SAT (Q1944049) (← links)
- An improved algorithm for the \((n, 3)\)-MaxSAT problem: asking branchings to satisfy the clauses (Q2051907) (← links)
- A fast algorithm for SAT in terms of formula length (Q2118334) (← links)
- On the complexity of unique circuit SAT (Q2202678) (← links)
- Hard satisfiable instances for DPLL-type algorithms (Q2577593) (← links)
- An Improved SAT Algorithm in Terms of Formula Length (Q3183448) (← links)
- An Empirical Study of MAX-2-SAT Phase Transitions (Q3439118) (← links)
- An Improved Algorithm for Detecting a Singleton Attractor in a Boolean Network Consisting of AND/OR Nodes (Q3599204) (← links)
- Exact Algorithms for MAX-SAT (Q4916231) (← links)
- (Q5150602) (← links)
- MAX SAT approximation beyond the limits of polynomial-time approximation (Q5957907) (← links)
- Further improvements for SAT in terms of formula length (Q6077846) (← links)