Sciweavers

Share
4 search results - page 1 / 1
» Generic-case complexity, decision problems in group theory a...
Sort
View
CORR
2002
Springer
113views Education» more  CORR 2002»
8 years 9 months ago
Generic-case complexity, decision problems in group theory and random walks
We give a precise definition of "generic-case complexity" and show that for a very large class of finitely generated groups the classical decision problems of group theor...
Ilya Kapovich, Alexei G. Myasnikov, Paul Schupp, V...
FCT
2007
Springer
9 years 3 months ago
The Quantum Query Complexity of Algebraic Properties
We present quantum query complexity bounds for testing algebraic properties. For a set S and a binary operation on S, we consider the decision problem whether S is a semigroup or ...
Sebastian Dörn, Thomas Thierauf
WWW
2008
ACM
9 years 10 months ago
Trust-based recommendation systems: an axiomatic approach
High-quality, personalized recommendations are a key feature in many online systems. Since these systems often have explicit knowledge of social network structures, the recommenda...
Reid Andersen, Christian Borgs, Jennifer T. Chayes...
IWLCS
2001
Springer
9 years 1 months ago
Explorations in LCS Models of Stock Trading
In previous papers we have described the basic elements for building an economic model consisting of a group of artiļ¬cial traders functioning and adapting in an environment conta...
Sonia Schulenburg, Peter Ross
books