725 search results - page 74 / 145 » Complexity of Computing with Extended Propositional Logic Pr... |
151
click to vote
ICALP
2003
Springer
15 years 11 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...
140
click to vote
ICLP
1999
Springer
15 years 10 months ago
1999
Springer
In this paper, we focus on the problem of existence of and computing small and large stable models. We show that for every xed integer k, there is a linear-time algorithm to decid...
183
click to vote
FCCM
2000
IEEE
15 years 10 months ago
2000
IEEE
Custom computing systems exhibit significant speedups over traditional microprocessors by mapping compute-intensive sections of a program to reconfigurable logic [Hauck98]. Howeve...
183
click to vote
ICFP
2005
ACM
16 years 6 months ago
2005
ACM
We present a foundation for a computational meta-theory of languages with bindings implemented in a computer-aided formal reasoning environment. Our theory provides the ability to...
155
click to vote
CCECE
2006
IEEE
16 years 6 days ago
2006
IEEE
The purpose of this paper is to use the aspect-oriented programming (AOP) paradigm for security testing. AOP allows security experts to develop and inject separate modules for con...