@book{compref693,
   author = {Temkin,ON and Zeigarnik,AV and Bonchev,DG},
   year = {1996},
   title = {Chemical Reaction Networks: A Graph-Theoretical Approach},
   publisher = {CRC PRess},
   address = {Boca Raton, FL}
}

@article{compref655,
   author = {De Reyck,B and Herroelen,W},
   year = {1996},
   title = {On the use of the complexity index as a measure of complexity in activity networks},
   journal = {European Journal of Operational Research},
   volume = {91},
   pages = {347-366}
}

@article{compref41,
   author = {Bechir,A and Kaminska,B},
   year = {1995},
   title = {CYCLOGEN: Automatic, Functional-Level Test Generator Based on the Cyclomatic Complexity Measure and on the ROBDD Representation},
   journal = {IEEE Transactions on Circuits and Systems - II: Analogue and Digital Signal Processing},
   volume = {42},
   pages = {446-452}
}

@article{compref316,
   author = {Subramanian,A},
   year = {1995},
   title = {The Parallel Complexity of Propagation in Boolean Circuits},
   journal = {Information and computation},
   volume = {117},
   pages = {266}
}

@article{compref302,
   author = {Siegelmann,HT},
   year = {1995},
   title = {Computation Beyond the turing Limit},
   journal = {Science},
   volume = {268},
   pages = {545-548}
}

@article{compref275,
   author = {Reggiani,A and Nijkamp,P},
   year = {1995},
   title = {Competition and complexity in spatially connected networks},
   journal = {System dynamics review},
   volume = {11},
   pages = {51-66}
}

@article{compref247,
   author = {O'Neal,MB and Edwards,WR},
   year = {1994},
   title = {Complexity Measures for Rule-Based Programs},
   journal = {IEEE Transactions on Knowledge and Data Engineering},
   volume = {6},
   pages = {669-680}
}

@article{compref204,
   author = {Lazarev,VI},
   year = {1992},
   title = {Complexity and Synthesis fo Minimal Logic Circuits using Multiplexers},
   journal = {Cybernetics},
   volume = {28},
   pages = {796-799}
}

@book{compref367,
   author = {Zuse,H},
   year = {1991},
   title = {Software Complexity},
   publisher = {Walter de Gruyter},
   address = {Berlin}
}

@article{compref318,
   author = {Sumners,DW},
   year = {1990},
   title = {Complexity Measures for Random Knots},
   journal = {Computers & Chemistry},
   volume = {14},
   pages = {275-279}
}

@book{compref34,
   author = {Balcazar,JL},
   year = {1990},
   title = {Structural Complexity},
   publisher = {Springer-Verlag},
   address = {Berlin}
}

@article{compref262,
   author = {Pippenger,N},
   year = {1989},
   title = {Invariance of Complexity Measures for Networks with Unreliable Gates},
   journal = {Journal of the Association of Computing Machinery},
   volume = {36},
   pages = {531-539}
}

@book{compref56,
   author = {B”rger,E},
   year = {1989},
   title = {Computability, Complexity, Logic},
   publisher = {North Holland},
   address = {Amsterdam}
}

@book{compref109,
   author = {Dunne,PE},
   year = {1988},
   title = {Complexity of Boolean Networks},
   publisher = {Academic Press},
   address = {London}
}

@article{compref261,
   author = {Pippenger,N},
   year = {1978},
   title = {Complexity Theory},
   journal = {Scientific American},
   volume = {239},
   pages = {90-100}
}

@article{compref228,
   author = {Marcus,MJ},
   year = {1977},
   title = {The Theory of Connecting Networks and their Complexity: A Review},
   journal = {Proceedings of the IEEE},
   volume = {65},
   pages = {1263-1271}
}

@book{compref296,
   author = {Savage,JE},
   year = {1976},
   title = {Complexity of Computing},
   publisher = {},
   address = {}
}

@article{compref293,
   author = {Sahal,D},
   year = {1976},
   title = {Elements of an Emerging theory of Complexity Per Se},
   journal = {Cybernetica},
   volume = {19},
   pages = {5-38}
}

@article{compref346,
   author = {Winograd,S},
   year = {1963},
   title = {Redundancy and Complexity of Logical Elements},
   journal = {Information and Control},
   volume = {5},
   pages = {177-194}
}