13621 search results - page 312 / 2725 » Computability and Complexity in Self-assembly |
162
click to vote
MFCS
2005
Springer
16 years 6 days ago
2005
Springer
We investigate the complexity of finding prime implicants and minimal equivalent DNFs for Boolean formulas, and of testing equivalence and isomorphism of monotone formulas. For DN...
158
click to vote
CDC
2009
IEEE
15 years 11 months ago
2009
IEEE
The objective of the standard parts optimal control problem is to find a number, m, of control inputs to a given input-output system that can be used in different combinations to...
183
Voted
COCO
2000
Springer
15 years 11 months ago
2000
Springer
Kolmogorov’s very first paper on algorithmic information theory (Kolmogorov, Problemy peredachi infotmatsii 1(1) (1965), 3) was entitled “Three approaches to the definition ...
167
click to vote
AAAI
2008
15 years 9 months ago
2008
We argue that parameterized complexity is a useful tool with which to study global constraints. In particular, we show that many global constraints which are intractable to propag...
147
click to vote
DAGSTUHL
2008
15 years 8 months ago
2008
Abstract. We present algorithmic, complexity and implementation results concerning real root isolation of a polynomial of degree d, with integer coefficients of bit size , using S...