5084 search results - page 175 / 1017 » Proving Possibility Properties |
130
click to vote
EVOTING
2004
15 years 7 months ago
2004
: As e-Voting gains more importance while practicable solutions are being implemented, more questions arise concerning alternative possibilities for a secure and feasible authentic...
165
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
Hardness results for maximum agreement problems have close connections to hardness results for proper learning in computational learning theory. In this paper we prove two hardnes...
186
click to vote
ECCC
2010
15 years 6 months ago
2010
We study the approximability of two natural Boolean constraint satisfaction problems: Horn satisfiability and exact hitting set. Under the Unique Games conjecture, we prove the fo...
138
click to vote
DM
2006
15 years 6 months ago
2006
A graph is called biclaw-free if it has no biclaw as an induced subgraph. In this note, we prove that if G is a connected bipartite biclaw-free graph with (G) 5, then G is collap...
138
click to vote
COMCOM
2004
15 years 6 months ago
2004
Very recently, the use of chaos synchronization as a means of masking information data in a network has been proposed. Although it is claimed that the security breach is not possi...