3172 search results - page 121 / 635 » On the Random-Self-Reducibility of Complete Sets |
176
click to vote
MST
2010
15 years 1 months ago
2010
The 1-versus-2 queries problem, which has been extensively studied in computational complexity theory, asks in its generality whether every efficient algorithm that makes at most 2...
131
click to vote
DAC
2002
ACM
16 years 7 months ago
2002
ACM
This paper gives a simple but nontrivial set of local transformation rules for Control-NOT(CNOT)-based combinatorial circuits. It is shown that this rule set is complete, namely, ...
176
click to vote
ACSC
2005
IEEE
16 years 1 days ago
2005
IEEE
We introduce a new approach to computing interprocedural modification side effects for Java programs in the presence of dynamic class loading. When compile-time unknown classes c...
154
click to vote
ICFEM
2005
Springer
15 years 12 months ago
2005
Springer
Abstract. In formal testing, the assumption of input enabling is typically made. This assumption requires all inputs to be enabled anytime. In addition, the useful concept of quies...
156
click to vote
ICLP
2004
Springer
15 years 11 months ago
2004
Springer
The extended answer set semantics for logic programs allows for the defeat of rules to resolve contradictions. We propose a refinement of these semantics based on a preference rel...