Sciweavers

13 search results - page 1 / 3
» Vote Counting as Mathematical Proof
Sort
View
LICS
1998
IEEE
13 years 9 months ago
On Proofs about Threshold Circuits and Counting Hierarchies
Hierarchies (Extended Abstract) Jan Johannsen Chris Pollett Department of Mathematics Department of Computer Science University of California, San Diego Boston University La Jolla,...
Jan Johannsen, Chris Pollett
POPL
2004
ACM
14 years 5 months ago
A logic you can count on
We prove the decidability of the quantifier-free, static fragment of ambient logic, with composition adjunct and iteration, which corresponds to a kind of regular expression langu...
Silvano Dal-Zilio, Denis Lugiez, Charles Meyssonni...
ESORICS
2003
Springer
13 years 10 months ago
Rapid Mixing and Security of Chaum's Visual Electronic Voting
Recently, David Chaum proposed an electronic voting scheme that combines visual cryptography and digital processing. It was designed to meet not only mathematical security standard...
Marcin Gomulkiewicz, Marek Klonowski, Miroslaw Kut...
IJCGA
2010
96views more  IJCGA 2010»
13 years 2 months ago
Frameworks Symmetry and Rigidity
Symmetry equations are obtained for the rigidity matrix of a bar-joint framework in Rd . These form the basis for a short proof of the FowlerGuest symmetry group generalisation of...
John C. Owen, Steve C. Power
MSS
2010
IEEE
120views Hardware» more  MSS 2010»
13 years 3 months ago
A critique of distributional analysis in the spatial model
Distributional analysis is widely used to study social choice in Euclidean models [35, 36, 1, 5, 11, 19, 8, 2, e.g]. This method assumes a continuum of voters distributed accordin...
Craig A. Tovey