6568 search results - page 256 / 1314 » Reducing the Complexity of Reductions |
189
click to vote
CAISE
2003
Springer
15 years 10 months ago
2003
Springer
This paper presents an approach for the improvement of the efficiency of the performance analysis of large workflow models. We propose a simple and powerful decidable Petri net red...
162
click to vote
TCC
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. We present a general parallel-repetition theorem with an efficient reduction. As a corollary of this theorem we establish that parallel repetition reduces the soundness e...
165
click to vote
JMLR
2010
15 years 1 months ago
2010
Working within the decision-theoretic framework for causal inference, we study the properties of "sufficient covariates", which support causal inference from observation...
201
click to vote
DLOG
2011
14 years 10 months ago
2011
We show that, although conjunctive queries over OWL 2 QL ontologies are reducible to database queries, no algorithm can construct such a reduction in polynomial time without changi...
166
click to vote
COLING
1992
15 years 7 months ago
1992
The main problem arising from the use of complex constraints in Computational Linguists is due to the NP-hardness of checking whether a given set of constraints is satisfiable and...