3946 search results - page 152 / 790 » The computational complexity of choice sets |
181
click to vote
SAS
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. Proving the termination of a flowchart program can be done by exhibiting a ranking function, i.e., a function from the program states to a wellfounded set, which strictl...
187
click to vote
TCOM
2008
15 years 6 months ago
2008
Abstract In multiuser MIMO systems, the base station schedules transmissions to a group of users simultaneously. Since the data transmitted to each user are different, in order to ...
198
click to vote
SIAMCOMP
2000
15 years 6 months ago
2000
In this paper we consider the complexity of several problems involving finite algebraic structures. Given finite algebras A and B, these problems ask the following. (1) Do A and B ...
175
click to vote
CPC
1998
15 years 6 months ago
1998
For any Boolean functionf letL(f) be its formulasizecomplexityin the basis f^ 1g. For every n and every k n=2, we describe a probabilistic distribution on formulas in the basis f^...
189
click to vote
AAAI
2012
13 years 9 months ago
2012
In recent years, several systems have been proposed that learn the rules of a simple card or board game solely from visual demonstration. These systems were constructed for speciï...