SubIndex on NETWORK (BibTex)
Click on the desired item or article for more information.- Temkin,ON; Zeigarnik,AV; Bonchev,DG; 1996, Chemical Reaction Networks: A Graph-Theoretical Approach, CRC PRess, Boca Raton, FL
- De Reyck,B; Herroelen,W; 1996, On the use of the complexity index as a measure of complexity in activity networks, European Journal of Operational Research, 91, 347-366
- Bechir,A; Kaminska,B; 1995, CYCLOGEN: Automatic, Functional-Level Test Generator Based on the Cyclomatic Complexity Measure and on the ROBDD Representation, IEEE Transactions on Circuits and Systems - II: Analogue and Digital Signal Processing, 42, 446-452
- Subramanian,A; 1995, The Parallel Complexity of Propagation in Boolean Circuits, Information and computation, 117, 266
- Siegelmann,HT; 1995, Computation Beyond the turing Limit, Science, 268, 545-548
- Reggiani,A; Nijkamp,P; 1995, Competition and complexity in spatially connected networks, System dynamics review, 11, 51-66
- O'Neal,MB; Edwards,WR; 1994, Complexity Measures for Rule-Based Programs, IEEE Transactions on Knowledge and Data Engineering, 6, 669-680
- Lazarev,VI; 1992, Complexity and Synthesis fo Minimal Logic Circuits using Multiplexers, Cybernetics, 28, 796-799
- Zuse,H; 1991, Software Complexity, Walter de Gruyter, Berlin
- Sumners,DW; 1990, Complexity Measures for Random Knots, Computers & Chemistry, 14, 275-279
- Balcazar,JL; 1990, Structural Complexity, Springer-Verlag, Berlin
- Pippenger,N; 1989, Invariance of Complexity Measures for Networks with Unreliable Gates, Journal of the Association of Computing Machinery, 36, 531-539
- B”rger,E; 1989, Computability, Complexity, Logic, North Holland, Amsterdam
- Dunne,PE; 1988, Complexity of Boolean Networks, Academic Press, London
- Pippenger,N; 1978, Complexity Theory, Scientific American, 239, 90-100
- Marcus,MJ; 1977, The Theory of Connecting Networks and their Complexity: A Review, Proceedings of the IEEE, 65, 1263-1271
- Savage,JE; 1976, Complexity of Computing, ,
- Sahal,D; 1976, Elements of an Emerging theory of Complexity Per Se, Cybernetica, 19, 5-38
- Winograd,S; 1963, Redundancy and Complexity of Logical Elements, Information and Control, 5, 177-194
| Top | Authors | Journals | Years | Keywords | Search | New | Comments |
Bruce Edmonds, Centre for Policy Modelling, Manchester Metropolitan University