11 search results - page 2 / 3 » Inclusion-exclusion formulas from independent complexes |
92
Voted
COCO
2006
Springer
15 years 4 months ago
2006
Springer
We consider the relationship between the complexities of - and those of restricted to formulas of constant density. Let be the infimum of those such that - on variables can be dec...
107
Voted
EPIA
2005
Springer
15 years 6 months ago
2005
Springer
The paper studies reductions of propositional theories in equilibrium logic to logic programs under answer set semantics. Specifically we are concerned with the question of how to...
156
Voted
TOPNOC
2010
14 years 7 months ago
2010
Information systems supporting business process are mostly very complex. If we have to ensure that certain business rules are enforced in a business process, it is often easier to ...
122
Voted
COCO
2005
Springer
15 years 6 months ago
2005
Springer
We prove that if NP ⊆ BPP, i.e., if SAT is worst-case hard, then for every probabilistic polynomial-time algorithm trying to decide SAT, there exists some polynomially samplable ...
101
Voted
CC
2007
Springer
15 years 1 months ago
2007
Springer
We prove that if NP ⊆ BPP, i.e., if SAT is worst-case hard, then for every probabilistic polynomial-time algorithm trying to decide SAT, there exists some polynomially samplable ...