530 search results - page 3 / 106 » An Algorithm for Approximating the Satisfiability Problem of... |
COMBINATORICA
2010
13 years 2 months ago
2010
We prove that the edges of every graph of bounded (Euler) genus can be partitioned into any prescribed number k of pieces such that contracting any piece results in a graph of bou...
SIGECOM
2010
ACM
13 years 8 months ago
2010
ACM
Cut games and party affiliation games are well-known classes of potential games. Schaffer and Yannakakis showed that computing pure Nash equilibrium in these games is PLScomplete....
GECCO
2010
Springer
13 years 8 months ago
2010
Springer
Evolutionary algorithms (EAs) are increasingly being applied to solve real-parameter optimization problems due to their flexibility in handling complexities such as non-convexity,...
COCO
2008
Springer
13 years 9 months ago
2008
Springer
We prove that the weighted monotone circuit satisfiability problem has no fixed-parameter tractable approximation algorithm with constant or polylogarithmic approximation ratio un...
IJCAI
2001
13 years 9 months ago
2001
New methods to generate hard random problem instances have driven progress on algorithms for deduction and constraint satisfaction. Recently Achlioptas et al. (AAAI 2000) introduc...