Generic-case complexity
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
- ArXiv
- 2015
We propose a more general definition of generic-case complexity, based on using a random process for generating inputs of an… (More)
Is this relevant?
2014
2014
- Algorithmica
- 2014
The conjugacy problem asks whether two words over generators of a fixed group G are conjugated, i.e., it is the problem to decide… (More)
Is this relevant?
2009
2009
- Groups Complexity Cryptology
- 2009
Generic case complexity has originated about a decade ago in combinatorial group theory [10, 2]. This area has long computational… (More)
Is this relevant?
2007
2007
- ArXiv
- 2007
This article is a short introduction to generic case complexity, which is a recently developed way of measuring the difficulty of… (More)
Is this relevant?
2007
2007
- Theory of Computing Systems
- 2007
Fischer and Rabin proved in (Proceedings of the SIAM-AMS Symposium in Applied Mathematics, vol. 7, pp. 27–41, 1974) that the… (More)
Is this relevant?
Highly Cited
2004
Highly Cited
2004
- 2004
We give a precise definition of “generic-case complexity” and show that for a very large class of finitely generated groups the… (More)
Is this relevant?
2003
2003
- 2003
We prove that Whitehead’s algorithm for solving the automorphism problem in a fixed free group Fk has strongly linear time… (More)
Is this relevant?
2002
2002
- ArXiv
- 2002
We give a precise definition of “generic-case complexity” and show that for a very large class of finitely generated groups the… (More)
Is this relevant?
2002
2002
- ArXiv
- 2002
We investigate the average-case complexity of decision problems for finitely generated groups, in particular the word and… (More)
Is this relevant?
2002
2002
- 2002
We give a precise definition of “generic-case complexity” and show that for a very large class of finitely generated groups the… (More)
Is this relevant?