Show simple item record

dc.contributor.authorSilaghi, Marius Cӑlin
dc.date.accessioned2013-11-07T17:31:06Z
dc.date.available2013-11-07T17:31:06Z
dc.date.issued2004-10-13
dc.identifier.citationSilaghi, M.C. (2004). Improving arithmetic circuits for solving constraint satisfaction and optimization problems (CS-2004-14). Melbourne, FL. Florida Institute of Technology.en_US
dc.identifier.otherCS-2004-14
dc.identifier.urihttp://hdl.handle.net/11141/148
dc.description.abstractIn the recent years we have proposed a set of secure multiparty computations for solving distributed constraint satisfaction and optimization problems, with applications to areas like distributed scheduling, configurations, team-making, and auctions. Some of the newest versions were based on an arithmetic circuit for selecting a random element out of the elements with a given value in a (secret) array. Here we show how to improve that arithmetic circuit by a factor of at least 4. The improvement is based on an optimization of the functions and on the usage of CSP solvers to exploit public constraints.en_US
dc.language.isoen_USen_US
dc.rightsCopyright held by author.en_US
dc.titleImproving arithmetic circuits for solving constraint satisfaction and optimization problemsen_US
dc.typeTechnical Reporten_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record