4940 search results - page 73 / 988 » On the Complexity of Universal Programs |
106
click to vote
TCS
2002
15 years 3 months ago
2002
Although the usual goal of sharing analysis is to detect which pairs of variables share, the standard choice for sharing analysis is a domain that characterizes set-sharing. In th...
113
click to vote
IWPC
2010
IEEE
15 years 2 months ago
2010
IEEE
We present a tool that identifies complex data-flow dependencies on code-level, based on the measure dep-degree. Low-level dependencies between program operations are modeled by...
116
click to vote
ICASSP
2008
IEEE
15 years 10 months ago
2008
IEEE
Signals and systems lab courses that are currently offered at many universities are mostly based on textbased programming languages and environments, in particular MATLAB. This pa...
114
click to vote
CP
2005
Springer
15 years 9 months ago
2005
Springer
QBF is the problem of deciding the satisfiability of quantified boolean formulae in which variables can be either universally or existentially quantified. QBF generalizes SAT (S...