The Program Committee of the 2001 Conference on Computational Complexity is happy to present the Ron Book Prize for Best Student Paper to Juergen Forster of the Ruhr-Universitaet, Bochum, Germany. The award is given annually to the most outstanding paper written solely by one or more students. The paper selected by the Complexity Program Committee is Complexity 2001 Ron Book Prize for Best Stud...

interpretation tools will flag a possible null pointer dereference at line 228, because the function “getOrder” can return null in case the order has no valid date. If this situation occurs an exception will be thrown, possibly resulting in program abortion. 3. Cyclomatic complexity. One of the oldest software metrics is cyclomatic complexity. Cyclomatic complexity counts the number of independ...

We develop a formal framework for program expansion, studying properties as completeness, minimality and computational complexity of expansions. We think that program expansion is the best framework to study procedurally defined revision processes as proposed in truth maintenance and logic programming such as dependency-directed backtracking and the recently proposed contradiction removal seman...

Since there are variations in the reaction times of athletes in different sports, the aim of the present study was to evaluate the effectiveness of a specific training program on a simple reaction time of male gymnasts. In this longitudinal study, fourteen adolescent gymnasts (mean age 12.6 ± 2.1 years) were randomly selected to work out for 15 months in the artistic group. Simple reaction ti...

Background: The main philosophy of postgraduate preparation for working in critical care units is to ensure the safety and quality of patients’ care. Increasing the complexity of technology, decision-making challenges and the high demand for advanced communication skills necessitate the need to educate learners. Within this aim, a master’s degree in critical care nursing has been ...

As the cost of software application failures grows and as these failures increasingly impact business performance, software reliability will become progressively more important. Employing effective software reliability engineering techniques to improve product and process reliability would be the industry’s best interests as well as major challenges. As software complexity and software quality ...

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...

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 analogue of the P = NP conjecture. We also describe the precise separation of complexity classes that their program proposes to demonstrate.

This is a short introduction to Kolmogorov complexity and information theory. The interested reader is referred to the literature, especially the textbooks [CT91] and [LV97] which cover the fields of information theory and Kolmogorov complexity in depth and with all the necessary rigor. They are well to read and require only a minimum of prior knowledge. Kolmogorov complexity. Also known as alg...

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.