Verifying termination property and estimating runtime complexity (the longest derivation length) are central issues in program analysis. Among several computational models used for the analysis, term rewriting is a simple and powerful computational model. Generally speaking, termination and complexity methods in term rewriting are much more sophisticated than their counterparts used in other pr...

We discuss the geometry of orbit closures and the asymptotic behavior of Kronecker coefficients in the context of the Geometric Complexity Theory program to prove a variant of Valiant’s algebraic analog of the P 6= NP conjecture. We also describe the precise separation of complexity classes that their program proposes to demonstrate.

Since the birth of Software Industry there is a special interest in measuring the effort in terms of time and cost that a task requires. Nowadays, since applications are essential for Industry, the software developers need to measure different kind of aspects: quality, cost, reliability, etc. Complexity is another important aspect in which software engineers are interested. But, what does we me...

We discuss the geometry of orbit closures and the asymptotic behavior of Kronecker coefficients in the context of the Geometric Complexity Theory program to prove a variant of Valiant’s algebraic analog of the P 6= NP conjecture. We also describe the precise separation of complexity classes that their program proposes to demonstrate.

Two philosophical applications of the concept of program-size complexity are discussed. First, we consider the light program-size complexity sheds on whether mathematics is invented or discovered, i.e., is empirical or is a priori. Second, we propose that the notion of algorithmic independence sheds light on the question of being and how the world of our experience can be partitioned into separ...

Two inheritance complexity metrics, one at class level CCI (Class Complexity due to Inheritance) and another at program level ACT (Average Complexity of a program due to Inheritance), have been proposed for object-oriented software systems. These proposed metrics are evaluated with Weyuker's properties and compared with other well known objectoriented inheritance metrics. It has been found that...

The central question of this paper is: How can design of Program Management contribute to the success of complex software implementations? Incomplete goal specifications, lack of communication, and underestimation of project complexity are signs of insufficient program and project management. To avoid these pitfalls, we will propose ways that have worked well in recent complex multi-project ERP...

Software complexity measurement has been an agelong quandary in software engineering as the effort used to develop, comprehend, or retain the software depends on so many complicated factors. Measuring and controlling of complexity will have an important influence to improve productivity, quality and maintenance of software. So far, most of the researches have tried to identify and measure the c...

recently tasks, as the basic units of syllabi, and the cognitive complexity, as the criterion for sequencing them, have caught many second language researchers’ attention. this study sought to explore the effect of utilizing the cognitively simple and complex tasks on high- and low-proficient efl iranian writers’ linguistic performance, i.e., fluency, accuracy, lexical complexity, and structura...