4940 search results - page 82 / 988 » On the Complexity of Universal Programs |
CORR
2006
Springer
15 years 4 months ago
2006
Springer
In a previous paper we have suggested a number of ideas to attack circuit size complexity with cohomology. As a simple example, we take circuits that can only compute the AND of t...
124
click to vote
LATA
2010
Springer
16 years 1 months ago
2010
Springer
Timed automata has been used as a powerful formalism for specifying, designing, and analyzing real time systems. We consider the generalization of timed automata to Pushdown Timed ...
101
click to vote
IWPC
2010
IEEE
15 years 2 months ago
2010
IEEE
The measure dep-degree is a simple indicator for structural problems and complex dependencies on code-level. We model low-level dependencies between program operations as use-def ...
132
click to vote
BMCBI
2008
15 years 4 months ago
2008
Background: With the rapid emergence of RNA databases and newly identified non-coding RNAs, an efficient compression algorithm for RNA sequence and structural information is neede...