Search results

| title = The complexity of membership problems for circuits over sets of integers | [[NEXPTIME]]-complete ...

...useful because it reduces computational problems to graph [[reachability]] problems. ...follows that graph-reachability is [[Complete (complexity)|complete]] for NL.<ref name="papa">[[Christos Papadimitriou|Papadimitriou, Christos H.]] (199 ...

=== Algorithmic problems === For circuits which use all the labels, all these problems are equivalent. ...

The most important problem which is complete for '''CC''' is a decision variant of the [[stable marriage problem]]. ...ator circuit value problem |year=2012|class=cs.CC }}</ref> is the class of problems '''[[AC0|AC⁰]]''' reducible to CCVP. ...

...[[complexity class]]es, rather than computational complexity of individual problems and algorithms. It involves the research of both internal structures of var ...show that both deterministic and nondeterministic machines can solve more problems in (asymptotically) more space, subject to certain conditions. For example, ...

...nd for many years afterward, pitchers were routinely expected to pitch a [[complete game]], and their [[Win (baseball)|win–loss record]] was considered suffici ...1912 (the outcome was called "Heydler's statistic" for a while, after then-NL secretary [[John Heydler]]), and the [[American League]] later accepted thi ...

...e [[Valiant–Vazirani theorem]], concerning unique solutions to NP-complete problems, has a simpler proof using the isolation lemma. This is proved by giving a ...Reinhardt and Allender later used the isolation lemma again to prove that NL/poly = UL/poly.<ref>{{harvtxt|Reinhardt|Allender|2000}}</ref> ...

...chastic Shortest Path Problem (d-SSPPR or R-SSPPR) and is [[NL-complete|NP-complete]]. The first variant is harder than the second because the former can repre ...ed the off-line problem because an algorithm for such a problem would have complete information of the graph. ...

...ach easy-to-verify problem can be solved as fast as SAT, which is hence NP-complete.]] In [[computational complexity theory]], a problem is '''NP-complete''' when: ...

...41|title=On a problem of Sidon in additive number theory, and some related problems|journal=Journal of the London Mathematical Society|series=Series 1|volume=1 ...riginal Erdős–Fuchs theorem, we cannot have'' <math>s_{\mathcal{A},2}(n) = nL(n) + o\big(n^{1/4}\log(n)^{-1/2}L(n)^\alpha \big)</math>, ''where'' <math>\ ...

...ned [[potential]] and temperature circumstances. Employing path integrals, problems hitherto unsolved were successfully worked out: Excluded volume, entangleme ...rite the [[Distribution function (physics)|distribution function]] for the complete polymer conformation as: ...

...atical, although numerical calculations are often conducted for particular problems too. DNA sequencing theory addresses ''physical processes'' related to sequ :<math>\left[1 - \frac{L}{G}\right]^N \sim \exp(-NL/G),</math> ...

...W. |last2=Regan |chapter=David Johnson: Galactic Algorithms |title=People, Problems, and Proofs: Essays from Gödel's Lost Letter: 2010 |publisher=Springer Berl ...portant open problem in computer science and one of the [[Millennium Prize Problems]].<ref>{{cite journal |author=Fortnow, L. |year=2009 |title=The status of t ...

PMS is known to be [[NP-complete]]. The [[Time complexity|time complexities]] of most of the planted motif s ...ast3 = Huang | first3 = C. H. | title = Exact algorithms for planted motif problems | journal = J. Comput. Biol. | volume = 12 | issue = 8 | pages = 1117–1128 ...

...hine learning, bioinformatics algorithms had to be programmed by hand; for problems such as [[protein structure prediction]], this proved difficult.<ref name=" ...ate of the generalization error, can be used directly for high-dimensional problems, and can easily be implemented in parallel. Statistically, random forests a ...

...dition, fairy chess pieces are used in [[fairy chess]], an area of [[chess problems]] involving changes to the rules of chess. ...eces|game pieces]] of [[fairy chess|unorthodox chess]], from fairy [[chess problems]] and [[chess variants]] (including [[chess variants#Chess-related historic ...

...agstukken uit de electronentheorie van het magnetisme |year=1919|language=nl}}</ref><ref>{{cite journal ...ic [[partial differential equations]] associated with Cauchy initial value problems. A special case was proven by [[Augustin Cauchy]] (1842), and the full resu ...