scientific article; zbMATH DE number 1500507
From MaRDI portal
Publication:4501522
zbMATH Open0959.68047MaRDI QIDQ4501522FDOQ4501522
Authors: Edward A. Hirsch 
Publication date: 6 May 2001
Title of this publication is not available (Why is that?)
Recommendations
Analysis of algorithms and problem complexity (68Q25) Complexity of computation (including implicit computational complexity) (03D15)
Cited In (24)
- New upper bounds for MAX-2-SAT and MAX-2-CSP w.r.t. the average variable degree
- A Spectral Method for MAX2SAT in the Planted Solution Model
- Efficient branch-and-bound algorithms for weighted MAX-2-SAT
- A universally fastest algorithm for Max 2-sat, Max 2-CSP, and everything in between
- New exact algorithms for the 2-constraint satisfaction problem
- An enumerative algorithm for \#2SAT
- Worst-case study of local search for MAX-\(k\)-SAT.
- Almost 2-SAT is fixed-parameter tractable
- Improving exact algorithms for MAX-2-SAT
- On the Lower Bounds of Random Max 3 and 4-SAT
- On the lower bounds of random Max 3 and 4-SAT
- Worst-case upper bounds for MAX-2-SAT with an application to MAX-CUT.
- Exact algorithms for MAX-SAT
- A new upper bound for Max-2-SAT: A graph-theoretic approach
- MAX-2-SAT
- Solving sparse instances of Max SAT via width reduction and greedy restriction
- Linear-programming design and analysis of fast algorithms for Max 2-CSP
- An upper (lower) bound for Max (Min) CSP
- A Tighter Bound for Counting Max-Weight Solutions to 2SAT Instances
- An Empirical Study of MAX-2-SAT Phase Transitions
- A general reduction theorem with applications to pathwidth and the complexity of Max 2-CSP
- A tighter upper bound for random MAX \(2\)-SAT
- A New Upper Bound for Max-2-SAT: A Graph-Theoretic Approach
- Improved exact algorithms for mildly sparse instances of MAX SAT
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4501522)
