41 citations · 202 across the 10 of their papers we have counts for
Showing cond-mat.dis-nnShow all
3 papers · 1 filter
cond-mat.dis-nn2005★ 8 cited
The computational complexity of Kauffman nets and the P versus NP problem
S. N. Coppersmith
Complexity theory as practiced by physicists and computational complexity theory as practiced by computer scientists both characterize how difficult it is to solve complex problems…
cond-mat.dis-nn2000★ 13 cited
Reversible boolean networks II: Phase transition, oscillation, and local structures
S. N. Coppersmith, Leo P. Kadanoff, Zhitong Zhang
We continue our consideration of a class of models describing the reversible dynamics of Boolean variables, each with inputs. We investigate in detail the behavior of the H…
cond-mat.dis-nn2000★ 24 cited
Reversible Boolean Networks I: Distribution of Cycle Lengths
S. N. Coppersmith, Leo P. Kadanoff, Zhitong Zhang
We consider a class of models describing the dynamics of Boolean variables, where the time evolution of each depends on the values of of the other variables. Previous work…