13 search results - page 3 / 3 » Vote Counting as Mathematical Proof |
SODA
2004
ACM
13 years 6 months ago
2004
ACM
Graph H is a root of graph G if there exists a positive integer k such that x and y are adjacent in G if and only if their distance in H is at most k. Motwani and Sudan [1994] prov...
ICAIL
2003
ACM
13 years 10 months ago
2003
ACM
This paper proposes a logic-oriented framework for institutional agents specification and analysis. Within this framework institutional agents are seen as artificial agents that a...
COMPGEOM
2009
ACM
13 years 12 months ago
2009
ACM
Topological persistence has proven to be a key concept for the study of real-valued functions defined over topological spaces. Its validity relies on the fundamental property tha...