4940 search results - page 58 / 988 » On the Complexity of Universal Programs |
154
click to vote
KBSE
1998
IEEE
15 years 8 months ago
1998
IEEE
We report on GADGET, a new software test generation system that uses combinatorial optimization to obtain condition/decision coverage of C/C++ programs. The GADGET system is fully...
149
click to vote
MOR
2007
15 years 3 months ago
2007
This paper studies the possibilities of the Linear Matrix Inequality (LMI) characterization of the matrix cones formed by nonnegative complex Hermitian quadratic functions over sp...
149
click to vote
MP
2011
14 years 11 months ago
2011
We perform a smoothed analysis of Renegar’s condition number for linear programming by analyzing the distribution of the distance to ill-posedness of a linear program subject to...
117
click to vote
DAGSTUHL
2007
15 years 5 months ago
2007
We present classical simulation techniques for measure once quantum branching programs. For bounded error syntactic quantum branching program of width w that computes a function w...
127
click to vote
EUROCOLT
1999
Springer
15 years 8 months ago
1999
Springer
The present paper motivates the study of mind change complexity for learning minimal models of length-bounded logic programs. It establishes ordinal mind change complexity bounds ...