116
click to vote
CPC
10 years 25 days ago
2016 
Let k be a positive integer and let X be a k-fold packing of infinitely many simply connected compact sets in the plane, that is, assume that every point belongs to at most k sets...
121
click to vote
CPC
10 years 25 days ago
2016
We consider “unconstrained” random k-XORSAT, which is a uniformly random system of m linear non-homogeneous equations in F2 over n variables, each equation containing k ≥ 3 v...
126
click to vote
CPC
10 years 25 days ago
2016
This paper addresses the following question for a given graph H: what is the minimum number f(H) such that every graph with average degree at least f(H) contains H as a minor? Due...
113
click to vote
CPC
10 years 25 days ago
2016 
Given a property of Boolean functions, what is the minimum number of queries required to determine with high probability if an input function satisfies this property? This is a f...
|
Artificial Intelligence