4066 search results - page 79 / 814 » Almost Complete Sets |
CBSE
2007
Springer
14 years 4 months ago
2007
Springer
Binary component-based software updates that are efficient, safe and generic still remain a challenge. Most existing deployment systems that achieve this goal have to control the c...
AML
2006
13 years 10 months ago
2006
Simpson introduced the lattice P of 0 1 classes under Medvedev reducibility. Questions regarding completeness in P are related to questions about measure and randomness. We presen...
AML
2005
13 years 10 months ago
2005
A DO model (here also referred to a Paris model) is a model M of set theory all of whose ordinals are first order definable in M. Jeffrey Paris (1973) initiated the study of DO mo...
CCCG
2009
13 years 8 months ago
2009
Motivated by the question of the polytopal realizability of the simplicial complex n,k of (k + 1)-crossing-free sets of diagonals of the convex n-gon, we study the first open case...
ISAAC
2007
Springer
14 years 4 months ago
2007
Springer
This paper shows that it is NP-hard to generate a minimum complete test set for stuck-at faults on the wires of a reversible circuit. We also show non-trivial lower bounds for the ...