Search results

...arithmic function|polynomials with periodically varying coefficients|quasi-polynomial}} ...ion (mathematics)|function]] <math>f(n)</math> is said to exhibit '''quasi-polynomial growth''' when it has an [[upper bound]] of the form ...

{{distinguish|Pseudo-polynomial time}} ...tant <math>c</math> such that the [[worst-case analysis|worst-case running time]] of the algorithm, on inputs of {{nowrap|size <math>n</math>,}} has an [[u ...

...olynomial for small characteristic of the field, whearas the second one is polynomial for small <math>n</math>; however, both of them are exponential if no restr The factorization of a polynomial <math>f</math> over a ground field <math>k</math> is reduced to the case wh ...

...decomposition''' of a [[polynomial system]] {{mvar|S}} is a set of simpler polynomial systems {{math|''S''₁, ..., ''S_e''}} such that a poin ..., those simpler systems are [[regular chain]]s. If the coefficients of the polynomial systems {{math|''S''₁, ..., ''S_e''}} are real numbers ...

...intermediate values of the clique size. The conjecture that no polynomial time solution exists is called the '''planted clique conjecture'''; it has been ==Algorithms== ...

==Well-quasi-ordering== ...initely many forbidden minors, shows that the minor ordering is not a well-quasi-ordering on all matroids. ...

...ze of its input and output, but whether they can be solved in [[polynomial time]] is an open problem. ...t whether two prime CNF expressions represent dual functions in polynomial time?}} ...

| title = Algorithms and Computation: 18th International Symposium, ISAAC 2007, Sendai, Japan, D {{unsolved|computer science|Is graph canonization polynomial time equivalent to the graph isomorphism problem?}} ...

...g [[Pseudorandomness|pseudorandom numbers]] for [[Quasi-Monte Carlo method|quasi-Monte Carlo]] (under the name [[Multiply-with-carry|Multiply With Carry]] ( ...ath> and <math>0</math>. It is possible to express u as a simple quadratic polynomial involving the initial state and the q_i.<ref name="FCSR1" /> ...

...vid |date=2006 |title=TRANSIT: Ultrafast Shortest-Path Queries with Linear-Time Preprocessing |url=https://pure.mpg.de/pubman/faces/ViewItemOverviewPage.js ...utomata, Languages and Programming |chapter=VC-Dimension and Shortest Path Algorithms |date=2011 |editor-last=Aceto |editor-first=Luca |editor2-last=Henzinger |e ...

...ult to [[approximation algorithm|approximate]]. However, it has a [[linear time]] solution for [[directed acyclic graph]]s, which has important application ...natorial Optimization: Polyhedra and Efficiency, Volume 1|volume=24|series=Algorithms and Combinatorics|first=Alexander|last=Schrijver|authorlink=Alexander Schri ...

...asi-identifiers need to be processed so that every distinct combination of quasi-identifiers designates at least ''k'' records. ...nd ''Weight''? Are they also non-identifying sensitive values, or are they quasi-identifiers? ...

...gether with the induction hypothesis to show that these sequences are well-quasi-ordered. ...any forbidden induced subgraphs, and therefore may be tested in polynomial time on graphs of bounded tree-depth. The graphs with tree-depth at most <math>d ...

...that many known algorithms for these problems have optimal or near-optimal time {{nowrap|complexity.{{r|ip99}}}} ...ay=block>s_k\le \log_2 \left(2-\frac2k\right)<1.</math> The '''exponential time hypothesis''' is the [[conjecture]] that they are all nonzero, or equivalen ...

...ee of accuracy. For polygon inputs, it may be solved exactly in polynomial time. The minimum weight triangulation has also sometimes been called the '''opt ...open problem whether the [[sum of radicals]] may be computed in polynomial time. However, Mulzer and Rote remark that the problem is NP-complete if the edg ...

...="Gersten"/>). The growth type of the Dehn function is a [[quasi-isometry| quasi-isometry invariant]] of a [[finitely presented group]]. The Dehn function o ...2), vol 156 (2002), no. 2, pp. 345&ndash;466.</ref> that most "reasonable" time complexity functions of [[Turing machine]]s can be realized, up to natural ...

...fied with its calculation at a finite number of locations and at specified time intervals. The [[partial differential equations]] are then reduced to a sys ...rectangular shape. The solution within each element is interpolated with a polynomial of usually low order. Again, the unknowns are the solution at the collocati ...

...contraction sequence of bounded width can be found for them in polynomial time: ...hmic number of bits per vertex, and that they have [[universal graph]]s of polynomial size in which each <math>n</math>-vertex graph of bounded twin-width can be ...

...be classified as a [[M-estimator]], a [[Quasi-maximum likelihood estimate|quasi-maximum likelihood estimator]] or a [[Mean squared prediction error|predict ...ons (SDEs) have become an important mathematical tool for describing the [[time evolution]] of several [[Randomness|random]] [[phenomenon]] in [[science|na ...

...eference (2.1&nbsp;GHz). The researchers estimate that improvements in the algorithms and software made this computation three times faster than would be expecte ...using the number field sieve. Most of the computation was done using idle time on various PCs and on a [[parallel computing]] cluster.<ref>Thorsten Kleinj ...