Search results

...mial hierarchy is contained in probabilistic Turing machine in polynomial time}} ...da|first=Seinosuke|date=October 1991|title=PP is as Hard as the Polynomial-Time Hierarchy|url=http://epubs.siam.org/doi/10.1137/0220053|journal=SIAM Journa ...

...e of the class [[NP (complexity)|NP]] of problems solvable in [[polynomial time]] by a [[non-deterministic Turing machine]]. It is the non-deterministic co ...polynomial time by a non-deterministic Turing machine that has access to a polynomial-bounded [[Advice (complexity)|advice]] function. ...

...teger coefficients, in [[polynomial time]]. This is of importance for many problems in [[computational geometry]], since the computation of the [[Euclidean dis ...irst=Johannes|last=Blömer|chapter=Computing sums of radicals in polynomial time|doi=10.1109/SFCS.1991.185434|year=1991|pages=670–677|title=[1991] P ...

...P-complete]] problem into another and is computable in [[pseudo-polynomial time]].<ref>{{cite book|last1=Garey|first1=M.&nbsp;R.|authorlink1=Michael R. Gar Some computational problems are parameterized by numbers whose magnitude exponentially exceed size of t ...

...ding deterministic algorithms]] for PIT, is one of the most important open problems in algebraic computing complexity. ...ast=Saxena | first=Nitin | author-link = Nitin Saxena | title=Progress on Polynomial Identity Testing | website=ECCC | date=2009-10-22 | issn=1433-8092 | url=ht ...

...alled '''BPLP''' (Bounded-error Probabilistic Logarithmic-space Polynomial-time),<ref>{{citation | title = Two applications of inductive counting for complementation problems ...

...hierarchy.svg|250px|thumb|right|Pictorial representation of the polynomial time hierarchy. The arrows denote inclusion.]] ...[[complexity class]]es, rather than computational complexity of individual problems and algorithms. It involves the research of both internal structures of var ...

...e complexity class [[♯P]].{{r|gss}} These reductions may also be called '''polynomial many-one counting reductions''' or '''weakly parsimonious reductions'''; th ...math> and <math>g</math>, both of which must be computable in [[polynomial time]]. The function <math>f</math> transforms inputs for <math>X</math> into in ...

...02614369|first = Robert E.|last = Tarjan|s2cid = 18977577}}</ref> Strongly polynomial dual network simplex algorithms for the same problem, but with a higher dep | title = Polynomial dual network simplex algorithms ...

...ts of all Littlewood polynomials with degree 1 through 14, one degree at a time.]] In [[mathematics]], a '''Littlewood polynomial''' is a [[polynomial]] all of whose coefficients are +1 or &minus;1. ...

...16-03-04 | url-status = dead }}</ref> PPP contains both [[PPAD]] and PWPP (polynomial weak pigeonhole principle) as subclasses. These complexity classes are of p ...is the set of all function computation problems that admit a [[polynomial-time reduction]] to the ''PIGEON'' problem, defined as follows: ...

...evska Williams. "Popular conjectures imply strong lower bounds for dynamic problems." 2014 IEEE 55th Annual Symposium on Foundations of Computer Science. IEEE, ...problem.<ref>Patrascu, Mihai. "Towards polynomial lower bounds for dynamic problems." Proceedings of the forty-second ACM symposium on Theory of computing. 201 ...

...blem, on graphs with no negative cycle, has a [[polynomial time|polynomial-time]] algorithm.{{r|ss}} ...lete]] problem.{{r|ss}} This is true even when the weights are integers of polynomial magnitude. In particular, there is a [[Reduction (complexity)|reduction]] f ...

...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 ...

...utive solutions and in terms of a '''preprocessing''' time, counted as the time before outputting the first solution. This complexity can be expressed in t ...theory]], and several [[complexity class]]es have been introduced for such problems. ...

{{Short description|Graph polynomial generating numbers of matchings}} ...ory)|matching]]s of various sizes in a graph. It is one of several [[graph polynomial]]s studied in [[algebraic graph theory]]. ...

| title = Open shop scheduling to minimize finish time ...nit processing times, where the goal is to minimize the maximum completion time. ...

..._Languages_II.html |archive-date=2019-10-31 |url-status=dead}}</ref> or in time <math>O(n+m)</math> if the automaton has ''n'' states and ''m'' transitions [[Category:Polynomial-time problems]] ...

...}</ref> (page 528), PPA is a subclass of [[TFNP]]. It is a class of search problems that can be shown to be total by an application of the [[handshaking lemma] ...A function computation problem belongs to PPA if it admits a [[polynomial-time reduction]] to this graph search problem. A problem is [[Complete (complexi ...

...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 ...