Sciweavers

51 search results - page 7 / 11
» Constraint Graph Analysis of Multithreaded Programs
Sort
View
ICALP
2007
Springer
14 years 1 months ago
Universal Algebra and Hardness Results for Constraint Satisfaction Problems
We present algebraic conditions on constraint languages Γ that ensure the hardness of the constraint satisfaction problem CSP(Γ) for complexity classes L, NL, P, NP and ModpL. Th...
Benoit Larose, Pascal Tesson
DISOPT
2007
155views more  DISOPT 2007»
13 years 7 months ago
Linear-programming design and analysis of fast algorithms for Max 2-CSP
The class Max (r, 2)-CSP (or simply Max 2-CSP) consists of constraint satisfaction problems with at most two r-valued variables per clause. For instances with n variables and m bin...
Alexander D. Scott, Gregory B. Sorkin
GG
2004
Springer
14 years 28 days ago
Workshop on Graph-Based Tools
Graphs are well-known, well-understood, and frequently used means to depict networks of related items. They are successfully used as the underlying mathematical concept in various ...
Tom Mens, Andy Schürr, Gabriele Taentzer
PODC
2009
ACM
14 years 8 months ago
Distributed and parallel algorithms for weighted vertex cover and other covering problems
The paper presents distributed and parallel -approximation algorithms for covering problems, where is the maximum number of variables on which any constraint depends (for example...
Christos Koufogiannakis, Neal E. Young
TSE
2008
113views more  TSE 2008»
13 years 7 months ago
Discovering Neglected Conditions in Software by Mining Dependence Graphs
Neglected conditions are an important but difficult-to-find class of software defects. This paper presents a novel approach for revealing neglected conditions that integrates stati...
Ray-Yaung Chang, Andy Podgurski, Jiong Yang