3172 search results - page 22 / 635 » On the Random-Self-Reducibility of Complete Sets |
COCO
1994
Springer
14 years 3 months ago
1994
Springer
We show the following results regarding complete sets.
COMBINATORICS
2000
13 years 10 months ago
2000
A construction is described for combining affine designs with complete sets of mutually orthogonal frequency squares to produce other complete sets. Key words: Matrices, orthogona...
STACS
2000
Springer
14 years 2 months ago
2000
Springer
We show that there is a set that is almost complete but not complete under polynomial-time many-one (p-m) reductions for the class E of sets computable in deterministic time 2lin ...
ENTCS
2008
13 years 11 months ago
2008
In this paper we introduce the notion of an observational coalgebra structure and of a complete set of co-operations. We demonstrate in various example the usefulness of these not...
IGPL
2008
13 years 11 months ago
2008
We study a logic whose formulae are interpreted as properties of a finite set over some universe. The language is propositional, with two unary operators inclusion and extension, ...