Sciweavers

4218 search results - page 7 / 844
» Complete sets of cooperations
Sort
View
COCO
1994
Springer
90views Algorithms» more  COCO 1994»
13 years 11 months ago
On the Structure of Complete Sets
We show the following results regarding complete sets.
Harry Buhrman, Leen Torenvliet
FSTTCS
2007
Springer
14 years 1 months ago
Strong Reductions and Isomorphism of Complete Sets
We study the structure of the polynomial-time complete sets for NP and PSPACE under strong nondeterministic polynomial-time reductions (SNP-reductions). We show the following resu...
Ryan C. Harkins, John M. Hitchcock, Aduri Pavan
COMBINATORICS
2000
91views more  COMBINATORICS 2000»
13 years 7 months ago
A Construction Method for Complete Sets of Mutually Orthogonal Frequency Squares
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...
Vassili C. Mavron
FFA
2011
90views more  FFA 2011»
13 years 2 months ago
Finite group algebras of nilpotent groups: A complete set of orthogonal primitive idempotents
We provide an explicit construction for a complete set of orthogonal primitive idempotents of finite group algebras over nilpotent groups. Furthermore, we give a complete set of ...
Inneke Van Gelder, Gabriela Olteanu
STACS
2000
Springer
13 years 11 months ago
Almost Complete Sets
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 ...
Klaus Ambos-Spies, Wolfgang Merkle, Jan Reimann, S...