Sciweavers

Share
5 search results - page 1 / 1
» Descriptive Complexity of Finite Abelian Groups
Sort
View
IJAC
2010
231views more  IJAC 2010»
10 years 9 months ago
Descriptive Complexity of Finite Abelian Groups
Title of dissertation: MODEL THEORY AND COMPLEXITY THEORY Walid Gomaa Doctor of Philosophy, 2007 Dissertation directed by: Professor William Gasarch Department of Computer Science...
Walid Gomaa
COCO
2011
Springer
216views Algorithms» more  COCO 2011»
9 years 11 months ago
Linear Systems over Finite Abelian Groups
We consider a system of linear constraints over any finite Abelian group G of the following form: i(x1, . . . , xn) ≡ i,1x1 + · · · + i,nxn ∈ Ai for i = 1, . . . , t and e...
Arkadev Chattopadhyay, Shachar Lovett
STOC
2005
ACM
113views Algorithms» more  STOC 2005»
11 years 12 months ago
Efficient testing of groups
We construct an efficient probabilistic algorithm that, given a finite set with a binary operation, tests if it is an abelian group. The distance used is an analogue of the edit d...
Katalin Friedl, Gábor Ivanyos, Miklos Santh...
IJAC
2008
84views more  IJAC 2008»
10 years 11 months ago
Groups whose Geodesics are Locally Testable
Abstract. A regular set of words is (k-)locally testable if membership of a word in the set is determined by the nature of its subwords of some bounded length k. In this article we...
Susan M. Hermiller, Derek F. Holt, Sarah Rees
CORR
2007
Springer
132views Education» more  CORR 2007»
10 years 11 months ago
Automatic Structures: Richness and Limitations
We study the existence of automatic presentations for various algebraic structures. An automatic presentation of a structure is a description of the universe of the structure by a...
Bakhadyr Khoussainov, André Nies, Sasha Rub...
books