4940 search results - page 355 / 988 » On the Complexity of Universal Programs |
169
click to vote
ICALP
2003
Springer
15 years 12 months ago
2003
Springer
A special class of oracle circuits with tree-vector form is introduced. It is shown that they can be evaluated in deterministic polynomial-time with a polylog number of adaptive qu...
158
Voted
DEBU
1999
15 years 6 months ago
1999
WOL is a Horn-clause language for specifying transformations involving complex types and recursive data-structures. Its declarative syntax makes programs easy to modify in respons...
206
click to vote
TLDI
2005
ACM
16 years 8 days ago
2005
ACM
Completely annotated lambda terms (such as are arrived at via the straightforward encodings of various types from System F) contain much redundant type information. Consequently, ...
164
click to vote
ASPLOS
1989
ACM
15 years 10 months ago
1989
ACM
A very long instruction word (VLIW) processorexploits parallelism by controlling multiple operations in a single instruction word. This paper describes the architecture and compil...
204
click to vote
CCGRID
2001
IEEE
15 years 10 months ago
2001
IEEE
- With the progress of research on cluster computing, more and more universities have begun to offer various courses covering cluster computing. A wide variety of content can be ta...