182 search results - page 7 / 37 » A Theory of Strict P-completeness |
DCC
2006
IEEE
14 years 7 months ago
2006
IEEE
Boolean functions on the space Fm 2 are not only important in the theory of error-correcting codes, but also in cryptography. In these two cases, the nonlinearity of these functio...
IROS
2009
IEEE
14 years 2 months ago
2009
IEEE
— Stability problems associated with haptics and robot control with obstacle avoidance are analyzed. Obstacle avoidance algorithms are revised to accomplish stable redesign using...
LATA
2010
Springer
14 years 2 months ago
2010
Springer
Operator precedence languages, designated as Floyd’s Languages (FL) to honor their inventor, are a classical deterministic context-free family. FLs are known to be a boolean fami...
ILC
2007
Springer
14 years 1 months ago
2007
Springer
Two-way alternating automata were introduced by Vardi in order to study the satisfiability problem for the modal µ-calculus extended with backwards modalities. In this paper, we ...
GG
2004
Springer
14 years 28 days ago
2004
Springer
We propose to study two infinite graph transformations that we respectively call bounded and unbounded path transduction. These graph transformations are based on path substitutio...