29908 search results - page 272 / 5982 » On the Complexity of |
173
click to vote
CORR
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. Symmetry is a common feature of many combinatorial problems. Unfortunately eliminating all symmetry from a problem is often computationally intractable. This paper argues...
175
click to vote
IPL
2010
15 years 5 months ago
2010
In this note, we present improved upper bounds on the circuit complexity of symmetric Boolean functions. In particular, we describe circuits of size 4.5n + o(n) for any symmetric ...
196
click to vote
PPDP
2010
Springer
15 years 4 months ago
2010
Springer
Given a set of Datalog rules, facts, and a query, answers to the query can be inferred bottom-up starting with the facts or top-down starting with the query. For efficiently answe...
141
click to vote
SIGDIAL
2010
15 years 4 months ago
2010
We point out several problems in scalingup statistical approaches to spoken dialogue systems to enable them to deal with complex but natural user goals, such as disjunctive and ne...
213
click to vote
ESSLLI
2009
Springer
15 years 4 months ago
2009
Springer
This paper describes cdiprover3 a tool for proving termination of term rewrite systems by polynomial interpretations and context dependent interpretations. The methods used by cdip...