The following pages link to (Q4162439):
Displayed 13 items.
- Methods and means of parallel processing of information (Q1155954) (← links)
- Bibliography on the evaluation of numerical software (Q1254823) (← links)
- Measuring prime program complexity (Q1328506) (← links)
- Using software complexity measures to analyze algorithms -- an experiment with the shortest-paths algorithms. (Q1413809) (← links)
- Algorithmic complexity of recursive and inductive algorithms (Q1434367) (← links)
- Resource monitors: A design methodology for operating systems (Q3334065) (← links)
- The Philosophy of Cybernetic Systems Evolution and Problems of Evolutionary Epistemology (Q3491502) (← links)
- A COMPARISON OF A NEW MEASURE OF LOGICAL COMPLEXITY OF PROGRAMS WITH THE HALSTEAD AND McCABE METHODS (Q3719804) (← links)
- Bewertung heuristischer Methoden (Q3941214) (← links)
- ZIPF-Halstead's theory of software metrication (Q3989772) (← links)
- (Q4212956) (← links)
- On the estimation of the parameters for the Littlewood model in software reliability (Q4850125) (← links)
- The design of decision trees in the framework of granular data and their application to software quality models (Q5951774) (← links)