1379 search results - page 142 / 276 » The Complexity of the Annihilating Polynomial |
224
click to vote
CNSR
2007
IEEE
15 years 10 months ago
2007
IEEE
This paper presents a data routing protocol for a non-mobile, locationaware wireless sensor network that is primarily designed for continuous monitoring application (e.g. environm...
148
click to vote
CSR
2006
Springer
15 years 10 months ago
2006
Springer
Zielonka's theorem shows that each regular set of Mazurkiewicz traces can be implemented as a system of synchronized processes provided with some distributed control structure...
135
click to vote
DGCI
2006
Springer
15 years 10 months ago
2006
Springer
This paper deals with the complexity of the decomposition of a digital surface into digital plane segments (DPS for short). We prove that the decision problem (does there exist a ...
146
click to vote
CSR
2008
Springer
15 years 8 months ago
2008
Springer
We define a denotational semantics for Light Affine Logic (LAL) which has the property that denotations of functions are polynomial time computable by construction of the model. Th...
204
click to vote
ACID
2006
15 years 7 months ago
2006
Matroid theory gives us powerful techniques for understanding combinatorial optimization problems and for designing polynomial-time algorithms. However, several natural matroid pr...