Span program is a linear-algebraic model of computation originally proposed for studying the complexity theory. Recently, it has become a useful tool for designing quantum algorithms. In this paper, we present a time-efficient span-program-based quantum algorithm for the following problem. Let T be an arbitrary tree. Given query access to the adjacency matrix of a graph G with n vertices, we ne...

Projects that do not have sufficient testing resources to perform 100% testing of new and changed programs may wish to focus their testing efforts on programs that are more likely to contain errors. Simple statement count metrics are compared with Cyclomatic Complexity counts and these are correlated with historical data from a large Gen application to understand the relationship between these ...

This paper describes the precise speci cation, design, analysis, implementation, and measurements of an e cient algorithm for solving regular tree grammar based constraints. The particular constraints are for dead-code elimination on recursive data, but the method used for the algorithm design and complexity analysis is general and applies to other program analysis problems as well. The method ...

We examine the complexity of testing di erent program constructs. We do this by de ning a measure of testing complexity known as VCP-dimension, which is similar to the Vapnik-Chervonenkis dimension, and applying it to classes of programs, where all programs in a class share the same syntactic structure. VCP-dimension gives bounds on the number of test points needed to determine that a program i...

Recent theory work has shown that a Genetic Program (GP) used to produce programs may have output that is bounded above by the GP itself [l]. This paper presents proofs that show that 1) a program that is the output of a GP or any inductive process has complexity that can be bounded by the Kolmogorov complexity of the originating program; 2) this result does not hold if the random number genera...

A longitudinal study found that the psychological approach individuals take when immersed in a general multicultural environment can predict subsequent career success. Using a culturally diverse sample, we found that ‘‘multicultural engagement’’—the extent to which students adapted to and learned about new cultures—during a highly international 10-month master of business administration (MBA) p...

A longitudinal study found that the psychological approach individuals take when immersed in a general multicultural environment can predict subsequent career success. Using a culturally diverse sample, we found that ‘‘multicultural engagement’’—the extent to which students adapted to and learned about new cultures—during a highly international 10-month master of business administration (MBA) p...

In this paper we propose a distributed approach to the inductive learning problem and present an implementation of the Distributed Learning System (DLS). Our method involves breaking up the data set into different sub-samples, using an inductive learning program (in our case PLS1) for each sample, and finally synthesizing the results given by each program into a final concept by using a genetic...

We examine the complexity of testing di erent program constructs. We do this by de ning a measure of testing complexity known as VCP-dimension, which is similar to the Vapnik-Chervonenkis dimension, and applying it to classes of programs, where all programs in a class share the same syntactic structure. VCP-dimension gives bounds on the number of test points needed to determine that a program i...