11 search results - page 2 / 3 » Inclusion-exclusion formulas from independent complexes |
COCO
2006
Springer
13 years 9 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...
EPIA
2005
Springer
13 years 10 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...
TOPNOC
2010
13 years 2 hour 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 ...
COCO
2005
Springer
13 years 10 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 ...
CC
2007
Springer
13 years 5 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 ...