# Complexity function

## Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2013

2013

- J. Comb. Theory, Ser. A
- 2013

In this paper we introduce and study a family of complexity functions of infinite words indexed by k âˆˆ Z+ âˆª {+âˆž}. Let k âˆˆ Zâ€¦Â (More)

Is this relevant?

2011

2011

- Int. J. Found. Comput. Sci.
- 2011

The notion of Abelian complexity of infinite words was recently used by the three last authors to investigate various Abelianâ€¦Â (More)

Is this relevant?

2009

2009

- ArXiv
- 2009

In this article we introduce the notion of a generalized system of fundamental sequences and we define its associated slowâ€¦Â (More)

Is this relevant?

2008

2008

- Comput. Graph. Forum
- 2008

The accurate generation of soft shadows is a particularly computationally intensive task. In order to reduce rendering time, mostâ€¦Â (More)

Is this relevant?

2006

2006

- 2006

We investigate the relation between the complexity function of a sequence, that is the number p(n) of its factors of length nâ€¦Â (More)

Is this relevant?

Highly Cited

2002

Highly Cited

2002

- 2002

Edith Penroseâ€™s (1959) book, The Theory of the Growth of the Firm, is considered by many scholars in the strategy field to be theâ€¦Â (More)

Is this relevant?

Highly Cited

1999

Highly Cited

1999

- Pattern Recognition Letters
- 1999

Generation of VCV/CVC balanced word sets for a speech data base. Some methods were proposed for the recognition of sets of aâ€¦Â (More)

Is this relevant?

1995

1995

- Developments in Language Theory
- 1995

In this paper, we prove the following result, which was conjectured by S. Ferenczi: if the complexity function of a sequence hasâ€¦Â (More)

Is this relevant?

Highly Cited

1989

Highly Cited

1989

- FPCA
- 1989

One way to analyse programs is to to derive expressions for their computational behaviour. A time bound function (or worst-caseâ€¦Â (More)

Is this relevant?

Highly Cited

1988

Highly Cited

1988

- ACM Trans. Program. Lang. Syst.
- 1988

There has been a great deal of research done on the evaluation of the complexity of particular algorithms; little effort, howeverâ€¦Â (More)

Is this relevant?