971 search results - page 30 / 195 » Approximate Satisfiability and Equivalence |
99
Voted
SAT
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. We consider the problem of computing tractable approximations to CNF formulas, extending the approach of Selman and Kautz to compute the Horn-LUB to involve renaming of v...
100
Voted
ATAL
2006
Springer
15 years 4 months ago
2006
Springer
This paper develops a new combinatorial auction protocol called the Groves Mechanism with SubModular Approximation (GM-SMA). This protocol satisfies the following characteristics:...
86
Voted
SODA
2010
ACM
15 years 10 months ago
2010
ACM
If a two-player social welfare maximization problem does not admit a PTAS, we prove that any maximal-in-range truthful mechanism that runs in polynomial time cannot achieve an app...
85
Voted
CORR
2010
Springer
14 years 11 months ago
2010
Springer
We analyze judgement aggregation problems in which a group of agents independently votes on a set of complex propositions that has some interdependency constraint between them (e....
92
Voted
APWEB
2007
Springer
15 years 7 months ago
2007
Springer
XQuery is a powerful language defined by the W3C to query XML documents. Its query functionalities and its expressiveness satisfy the major needs of both the database community an...