3172 search results - page 31 / 635 » On the Random-Self-Reducibility of Complete Sets |
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 5 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 ...
FDL
2007
IEEE
14 years 5 months ago
2007
IEEE
Abstract—Property-based synthesis has become a more prominent topic during the last years, being used in multiple areas like e.g. formal verification and design automation. We w...
DM
2002
13 years 10 months ago
2002
Some recent results provide su cient conditions for complete lattices of closure operators on complete lattices, ordered pointwise, to be pseudocomplemented. This paper gives resu...
DM
1998
13 years 10 months ago
1998
Cameron introduced a natural probability measure on the set S of sum-free sets, and asked which sets of sum-free sets have a positive probability of occurring in this probability m...