Explore Polynomially through 5 example sentences from English, with an explanation of the meaning. Ideal for language learners, writers and word enthusiasts.
Polynomially meaning
In a polynomial way.
Using Polynomially
- The main meaning on this page is: In a polynomial way.
- In the example corpus, polynomially often appears in combinations such as: polynomially many.
Context around Polynomially
- Average sentence length in these examples: 23.6 words
- Position in the sentence: 0 start, 5 middle, 0 end
- Sentence types: 5 statements, 0 questions, 0 exclamations
Corpus analysis for Polynomially
- In this selection, "polynomially" usually appears in the middle of the sentence. The average example has 23.6 words, and this corpus slice is mostly made up of statements.
- Around the word, subroutine, grows, compact and bounded stand out and add context to how "polynomially" is used.
- Recognizable usage signals include a subroutine polynomially many polynomial and of its polynomially many steps. That gives this page its own corpus information beyond isolated example sentences.
- By corpus frequency, "polynomially" sits close to words such as aaas, aacc and aacs, which helps place it inside the broader word index.
Example types with polynomially
The same corpus examples are grouped by length and sentence type, making it easier to see the contexts in which the word appears:
When r is very small, N(r) grows polynomially with 1/r. (12 words)
If a polynomial time algorithm calls as a subroutine polynomially many polynomial time algorithms, the resulting algorithm is still polynomial time. (21 words)
It states: "Reasonable" machines can simulate each other within a polynomially bounded overhead in time and a constant-factor overhead in space. (22 words)
Conversely, suppose we have a nondeterministic TM called A accepting a given language L. At each of its polynomially many steps, the machine's computation tree branches in at most a finite number of directions. (35 words)
Bernstein and Robinson show that if T is polynomially compact, then there is a hyperfinite index w such that the matrix coefficient a w+1,w is infinitesimal. (28 words)
It states: "Reasonable" machines can simulate each other within a polynomially bounded overhead in time and a constant-factor overhead in space. (22 words)
Example sentences (5)
Bernstein and Robinson show that if T is polynomially compact, then there is a hyperfinite index w such that the matrix coefficient a w+1,w is infinitesimal.
Conversely, suppose we have a nondeterministic TM called A accepting a given language L. At each of its polynomially many steps, the machine's computation tree branches in at most a finite number of directions.
If a polynomial time algorithm calls as a subroutine polynomially many polynomial time algorithms, the resulting algorithm is still polynomial time.
It states: "Reasonable" machines can simulate each other within a polynomially bounded overhead in time and a constant-factor overhead in space.
When r is very small, N(r) grows polynomially with 1/r.
Common combinations with polynomially
These word pairs occur most frequently in English texts: