Jump to content
Wikipedia The Free Encyclopedia

Talk:Counting problem (complexity)

Page contents not supported in other languages.
From Wikipedia, the free encyclopedia
This article is rated Stub-class on Wikipedia's content assessment scale.
It is of interest to the following WikiProjects:
WikiProject icon Computer science
WikiProject icon This article is within the scope of WikiProject Computer science , a collaborative effort to improve the coverage of Computer science related articles on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.Computer scienceWikipedia:WikiProject Computer scienceTemplate:WikiProject Computer scienceComputer science
??? This article has not yet received a rating on the project's importance scale.
Things you can help WikiProject Computer science with:

Why is y less than or equal to c_r?

[edit ]

y, to my understanding, isn't necessarily a number, so what's the meaning of the inequality? I think it's supposed to be y is a subset of the set defined in the cardinality of c_r..

In my understanding the symbol y {\displaystyle y} {\displaystyle y} denotes a non-negative integer that can hence be compared to c R ( x ) {\displaystyle c_{R}(x)} {\displaystyle c_{R}(x)}, the size (that is number of elements) of the set of solutions { y ( x , y ) R } {\displaystyle \{y\mid (x,y)\in R\}} {\displaystyle \{y\mid (x,y)\in R\}}. I believe one needs to be a bit more careful in phrasing the definition, because a priori there is no bound on the number of solutions since in general R {\displaystyle R} {\displaystyle R} is a binary relation between infinite sets (e.g. all strings over a finite (usually two-element) alphabet). Of course one may allow infinitely many solution for certain inputs x {\displaystyle x} {\displaystyle x}. For such x {\displaystyle x} {\displaystyle x} every pair ( x , n ) {\displaystyle (x,n)} {\displaystyle (x,n)} will belong to # R {\displaystyle \#R} {\displaystyle \#R}. One way to make the number c R ( x ) {\displaystyle c_{R}(x)} {\displaystyle c_{R}(x)} always finite is to just postulate this in the definition of R {\displaystyle R} {\displaystyle R}. Often this is achieved by making more restrictive assumptions such a that there is a function f : N N {\displaystyle f\colon \mathbb {N} \to \mathbb {N} } {\displaystyle f\colon \mathbb {N} \to \mathbb {N} } (of a certain kind, e.g. a polynomial function) such that for every input x {\displaystyle x} {\displaystyle x} there are only solutions y {\displaystyle y} {\displaystyle y} satisfying ( x , y ) R {\displaystyle (x,y)\in R} {\displaystyle (x,y)\in R} with bounded length | y | f ( | x | ) {\displaystyle |y|\leq f(|x|)} {\displaystyle |y|\leq f(|x|)} and hence finitely many.

Notation

[edit ]

I think the problem needs to be stated in English, as with this unspecified notation it's basically unintelligible. 81.2.154.16 (talk) 20:30, 7 July 2022 (UTC) [reply ]

AltStyle によって変換されたページ (->オリジナル) /