11160 search results - page 194 / 2232 » Incompleteness in a General Setting |
125
click to vote
GLVLSI
2007
IEEE
15 years 10 months ago
2007
IEEE
A probabilistic power estimation technique for combinational circuits is presented. A novel set of simple waveforms is the kernel of this technique. The transition density of each...
193
click to vote
FOCS
2002
IEEE
15 years 9 months ago
2002
IEEE
The Constraint Satisfaction Problem (CSP) provides a common framework for many combinatorial problems. The general CSP is known to be NP-complete; however, certain restrictions on...
137
click to vote
ACS
2004
15 years 4 months ago
2004
For a complete lattice V which, as a category, is monoidal closed, and for a suitable Setmonad T we consider (T, V)-algebras and introduce (T, V)-proalgebras, in generalization of...
116
click to vote
SAT
2007
Springer
15 years 10 months ago
2007
Springer
We demonstrate hardness results for the detection of small backdoor sets with respect to base classes Mr of CNF formulas with maximum deficiency ≤ r (M0 is the class of matched...
115
click to vote
AUTOMATICA
2008
15 years 4 months ago
2008
This paper is concerned with obtaining necessary and sufficient conditions for fulfilling specified state and control pointwise-in-time constraints against a certain class of nonli...