5 search results - page 1 / 1 » Dichotomy Results for Fixed Point Counting in Boolean Dynami... |
ICTCS
2007
Springer
13 years 11 months ago
2007
Springer
CORR
2008
Springer
13 years 5 months ago
2008
Springer
UC
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. We study computational complexity of counting the fixed point configurations (FPs) in certain classes of graph automata viewed as discrete dynamical systems. We prove t...
CORR
2008
Springer
13 years 5 months ago
2008
Springer
We consider a product X of n finite intervals of integers, a map F from X to itself, the asynchronous state transition graph (F) on X that Thomas proposed as a model for the dynam...
VTC
2006
IEEE
13 years 11 months ago
2006
IEEE
OFDM has a very high peak-to-average power ratio. This imposes stringent dynamic range requirements on the analog front-ends of the transmitter and receiver and, if a fixedpoint pr...