4940 search results - page 347 / 988 » On the Complexity of Universal Programs |
159
click to vote
TC
1998
15 years 6 months ago
1998
—Many modern Field Programmable Logic Arrays (FPGAs) use lookup table (LUT) logic blocks which can be programmed to realize any function of a fixed number of inputs. It is possib...
184
click to vote
IEE
2010
15 years 5 months ago
2010
A key problem in compositional model checking of software systems is that typical model checkers accept only closed systems (runnable programs) and therefore a component cannot be ...
186
click to vote
FSTTCS
2009
Springer
16 years 1 months ago
2009
Springer
We study the branching program complexity of the tree evaluation problem, introduced in [BCM+09a] as a candidate for separating NL from LogCFL. The input to the problem is a roote...
174
click to vote
ICNS
2008
IEEE
16 years 1 months ago
2008
IEEE
The programmable network approach allows processing of passing user data in a network, which is highly suitable especially for multimedia streams processing. However, programming ...
186
click to vote
APLAS
2004
ACM
16 years 4 days ago
2004
ACM
Abstract. More than being just a tool for expressing algorithms, a welldesigned programming language allows the user to express her ideas efficiently. The design choices however eï...