546 search results - page 74 / 110 » Extended Null-Move Reductions |
105
click to vote
LFCS
1992
Springer
15 years 1 months ago
1992
Springer
This paper addresses the problem of extending the formulae-as-types principle to classical logic. More precisely, we introduce a typed lambda-calculus (-LK ) whose inhabited types...
DLOG
2007
15 years 1 days ago
2007
We present a query answering technique based on notions and results from modal Correspondence Theory. It allows us to answer a wide family of conjunctive queries by polynomial redu...
APAL
2005
14 years 9 months ago
2005
In this paper we consider distributive modal logic, a setting in which we may add modalities, such as classical types of modalities as well as weak forms of negation, to the fragm...
VLSID
1997
IEEE
15 years 1 months ago
1997
IEEE
I n this paper, we first present a pipelined delayed least mean square (DLMS) adaptive filter architecture whose power dissipation meets a specified budget. This low-power archite...
FOCS
1996
IEEE
15 years 1 months ago
1996
IEEE
A common subproblem of DNF approximate counting and derandomizing RL is the discrepancy problem for combinatorial rectangles. We explicitly construct a poly(n)-size sample space t...