Logic (first order or temporal) can be easily extended to describe counts, parity and other numerical phenomena. The satisfiability problem of the extended logic is easily seen to be undecidable, even on models which are finite words.
This talk will be an introduction to Social Choice Theory, which analyses methods to combine preferences of large number of voters to obtain a result that is fair .
We show that in the Poisson continuum percolation model on the plane there is a sharp transition from a regime which admits unbounded vacant clusters to a regime which admits unbounded occupied clusters.
Recommendation systems are commonly used in e-commerce to suggest relevant content to users. Popular examples include Amazon, iTunes Genius, Google News and typically they operate on a corpus of millions of users/items.
We study the quantum query complexity of minor-closed graph properties, which include such problems as determining whether a graph is planar, is a forest, or does not contain a path of a given length.
`Dyad' means a pair, `dyadic' means binary, and in this talk I'll present some simple algorithms for rounding real vectors to 0-1 vectors without losing much.
