1679 search results - page 38 / 336 » Strong order equivalence |
RTA
2010
Springer
14 years 1 months ago
2010
Springer
For the whole class of linear term rewriting systems and for each integer k, we define k-bounded rewriting as a restriction of the usual notion of rewriting. We show that the k-bo...
CPAIOR
2010
Springer
13 years 8 months ago
2010
Springer
Many search problems contain large amounts of redundancy in the search. In this paper we examine how to automatically exploit remaining subproblem equivalence, which arises when tw...
FSTTCS
2001
Springer
14 years 2 months ago
2001
Springer
For any class C und closed under NC1 reductions, it is shown that all sets complete for C under first-order (equivalently, Dlogtimeuniform AC0 ) reductions are isomorphic under ...
GLVLSI
2008
IEEE
14 years 4 months ago
2008
IEEE
Novel nano-scale devices have shown promising potential to overcome physical barriers faced by complementary metaloxide semiconductor (CMOS) technology in future circuit design. H...
CC
2008
Springer
13 years 12 months ago
2008
Springer
Portable low-level C programs must often support multiple equivalent in-memory layouts of data, due to the byte or bit order of the compiler, architecture, or external data formats...