Sciweavers

305 search results - page 2 / 61
» Symmetric Enumeration Reducibility
Sort
View
JSYML
2007
78views more  JSYML 2007»
14 years 9 months ago
The settling-time reducibility ordering
Abstract. To each computable enumerable (c.e.) set A with a particular enumeration {As}s∈ω, there is associated a settling function mA(x), where mA(x) is the last stage when a n...
Barbara F. Csima, Richard A. Shore
APAL
1998
121views more  APAL 1998»
14 years 9 months ago
Computably Enumerable Sets and Quasi-Reducibility
We consider the computably enumerable sets under the relation of Qreducibility. We first give several results comparing the upper semilattice of c.e. Q-degrees, RQ, ≤Q , under ...
Rodney G. Downey, Geoffrey LaForte, André N...
DM
2006
93views more  DM 2006»
14 years 10 months ago
The number of equivalence classes of symmetric sign patterns
This paper shows that the number of sign patterns of totally non-zero symmetric n-by-n matrices, up to conjugation by monomial matrices and negation, is equal to the number of unl...
Peter J. Cameron, Charles R. Johnson
EOR
2006
74views more  EOR 2006»
14 years 10 months ago
A set theoretic framework for enumerating matches in surveys and its application to reducing inaccuracies in vehicle roadside su
This paper describes a framework for analysing matches in multiple data sets. The framework described is quite general and can be applied to a variety of problems where matches ar...
Richard G. Clegg