query: Query complexity of identifying a subset
positive_passages.docid: 153072
positive_passages.text: Guessing a subset of $\{1,...,N\}$
negative_passages.docid: 127123
negative_passages.text: Cardinality of power set and binary sequence
negative_passages.docid: 67702
negative_passages.text: Minimal dense subset
negative_passages.docid: 82947
negative_passages.text: Undecidable cardinality
negative_passages.docid: 25769
negative_passages.text: Finding all posets on a set
negative_passages.docid: 72391
negative_passages.text: linear dependence proof using subsets
negative_passages.docid: 42724
negative_passages.text: Time complexity of memory allocation
negative_passages.docid: 98850
negative_passages.text: A positional number system for enumerating fixed-size subsets?
negative_passages.docid: 72213
negative_passages.text: Can a $N-1$ rectifiable set be partitioned into countably many connected pieces?
negative_passages.docid: 21754
negative_passages.text: Partition a set into subsets of size $k$
negative_passages.docid: 42358
negative_passages.text: Find a Borel subset satisfying the condition
negative_passages.docid: 46430
negative_passages.text: A simple decision problem whose decidability is not known
negative_passages.docid: 111561
negative_passages.text: Distance of a point to a subset.
negative_passages.docid: 45485
negative_passages.text: Dimension of a subset
negative_passages.docid: 95373
negative_passages.text: Additive set function on a semiring of sets
negative_passages.docid: 6291
negative_passages.text: Proving something is a linearly independent subset
negative_passages.docid: 108275
negative_passages.text: How do I count the subsets of a set whose number of elements is divisible by 3? 4?