432 search results - page 19 / 87 » Open Problems with Part-Whole Relations |
96
Voted
CC
2007
Springer
15 years 13 days ago
2007
Springer
Abstract. The problem of testing membership in the subset of the natural numbers produced at the output gate of a {∪, ∩,− , +, ×} combinational circuit is shown to capture a...
98
Voted
ACSD
2005
IEEE
15 years 6 months ago
2005
IEEE
We introduce and study problems of distributed observation with bounded or unbounded memory. We are given a system modeled as a finite-word language L over some finite alphabet ...
102
click to vote
IPL
2008
15 years 13 days ago
2008
A problem open for many years is whether there is an FPT algorithm that given a graph G and parameter k, either: (1) determines that G has no k-Dominating Set, or (2) produces a do...
112
click to vote
LICS
2010
IEEE
14 years 11 months ago
2010
IEEE
We define tree automata with global constraints (TAGC), generalizing the well-known class of tree automata with global equality and disequality constraints [14] (TAGED). TAGC can...
106
Voted
ISAAC
2009
Springer
15 years 7 months ago
2009
Springer
We study the following question, communicated to us by Mikl´os Ajtai: Can all explicit (e.g., polynomial time computable) functions f : ({0, 1}w )3 → {0, 1}w be computed by word...