Search results

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

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

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

...transformation''' is a function which maps instances of one [[strongly NP-complete]] problem into another and is computable in [[pseudo-polynomial time]].<ref Some computational problems are parameterized by numbers whose magnitude exponentially exceed size of t ...

...he Theory of NP-Completeness|Garey & Johnson's]] classical [[NP-complete]] problems.<ref name="GareyJohnson"/> The problem is sometimes called [[Property B|hyp ...tion which maximizes the number of split elements of ''F''. It is an [[APX-complete]]<ref name="Petrank94"/> problem and hence in [[Optimization_problem#NP_opt ...

...-deterministic complexity class corresponding to the deterministic class [[P/poly]]. NP/poly is defined as the class of problems solvable in polynomial time by a non-deterministic Turing machine that has ...

...tion of [[Complete (complexity)|completeness]] for the complexity class [[♯P]].{{r|gss}} These reductions may also be called '''polynomial many-one coun ...tion]] is a polynomial-time transformation <math>f</math> on the inputs to problems that preserves the exact values of the outputs. Such a reduction can be vie ...

{{Short description|Classic NP-complete problem in computer science}} ...larkson.edu/~alexis/PCMI/Notes/lectureB07.pdf|title=Lecture 7: NP-Complete Problems|date=July 5, 2000|author=David Mix Barrington and Alexis Maciel}}</ref> In ...

...lly, it is a [[bijection]] between the respective sets of solutions of two problems. A general reduction from problem <math>A</math> to problem <math>B</math> ...lexity)|counting problems]], for counting complexity classes such as [[♯P|#P]]. Additionally, they are used in game complexity, as a way to design hard ...

...istic quantum computation with one clean qubit''' is the class of decision problems solvable by a one clean qubit machine in polynomial time, upon measuring th ...he circuits and sampling problems, and use '''BQ1P''' to refer to decision problems.</ref> It is also not strengthened by measuring all of these clean qubits ( ...

...plexity]], '''not-all-equal 3-satisfiability''' ('''NAE3SAT''') is an [[NP-complete]] variant of the [[Boolean satisfiability problem]], often used in proofs o [[File:Monotone NAE3SAT.svg|thumb|180px|'''Monotone''' NAE3SAT problems can be represented by [[vertex coloring]] a [[hypergraph]] so that every ed ...

...iding whether a given clause θ-subsumes another is an [[NP-completeness|NP-complete]] problem. ...math> is a subset of <math display="inline">c_2</math>.{{sfn|De Raedt|2008|p=127}} ...

...basis for proofs that various games and puzzles are PSPACE-hard or PSPACE-complete. | title = PSPACE-completeness of sliding-block puzzles and other problems through the nondeterministic constraint logic model of computation ...

...They are particularly useful in the study of [[Bayesian inference|inverse problems]] on [[function space]]s for which a Gaussian [[prior probability|Bayesian ...]] for <math>H</math>. Let <math>s \in \mathbb{R}</math> and <math>1 \leq p < \infty</math>. For <math>u = \sum_{n \in \mathbb{N}} u_{n} e_{n} \in H</ ...

'''Kolchin's problems''' are a set of unsolved problems in [[differential algebra]], outlined by [[Ellis Kolchin]] at the [[Interna ...\in \Sigma </math> , does there exist a long gap chain beginning at <math> p </math> and ending at <math> \Sigma </math>? ...

...t to look for constants of motion or [[Quantum invariants|invariants]] for problems of this kind. For the (time dependent) [[harmonic oscillator]] it is possib : <math>\hat{H} =\frac{1}{2}\left[\hat{p}^2+\Omega^2(t)\hat{q}^2\right].</math> ...

The problem belongs to the complexity class [[P (complexity)|P]]. This can be [[mathematical proof|proven]] using the [[Gale–Ryser theorem ==Related problems== ...

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

== Complexity and algorithmic problems == ...ing the output of a given [[Boolean circuit]] on a specific input is a [[P-complete]] problem. If the input is an [[integer circuit]], however, it is unknown w ...

...E.]], [http://dml.cz/dmlcz/128448 On Frolík's characterization of class ''P'']. ''Czechoslovak Mathematical Journal'', vol. 44 (1994), issue 1, pp. 1-6 *Generalizations of the Gδ-property of complete metric spaces - Czechoslovak Math. J., 10 (1960), pp.&nbsp;359–379 ...