It is important to identify modules that are fault prone or exhibit evidence of high cognitive complexity as these modules require corrective actions such as increased source code inspection, refactoring or performing more exhaustive testing. This can lead to a better quality software system. It has been found that inheritance has an impact on the cognitive complexity of a software system. In t...

This paper models complexity in social programs as a byproduct of efforts to screen between deserving and undeserving applicants. While a more rigorous screening technology may have desirable effects on targeting efficiency, the associated complexity introduces transaction costs into the application process and may induce incomplete take up. The paper integrates the study of take up with the st...

! #"! $ % ! & " '( ) * ! " + , . 0/ ! 1 23 ! 4 * ( 5"6 , 7 '98+:+;=<( >"! 1 1 0 ! ,"! ( ,7?'@< A 7(B0 C 1 DFEG H 5"! ?'I @ J ! K L 1 I'( 0 L ,

In this paper we propose a tool for controlling the complexity of Genetic Programming models. The tool is supported by the theory of Vapnik-Chervonekis dimension (VCD) and is combined with a novel representation of models named straight line program. Experimental results, implemented on conventional algebraic structures (such as polynomials) and real problems, show that the empirical risk, pena...

In this paper we propose a tool for controlling the complexity of Genetic Programming models. The tool is supported by the theory of VapnikChervonekis dimension and is combined with a novel representation of models named straight line program. Experimental results, implemented on conventional algebraic structures (such as polynomials) and real problems, show that the empirical risk, penalized b...

Polynomial interpretations and their generalizations like quasi-interpretations have been used in the setting of first-order functional languages to design criteria ensuring statically some complexity bounds on programs [1]. This fits in the area of implicit computational complexity, which aims at giving machine-free characterizations of complexity classes. Here we extend this approach to the h...