Secure Combinatorial Optimization using DFS-based Variable Elimination

  • Silaghi, Faltings


It is known that, in general, Constraint Optimization Problems (COP) are NP-hard. Existing arithmetic circuits for secure protocols solving such problems are exponential in the number of variables, n. Recently a combinatorial optimization algorithm was proposed whose cost is exponential only in a parameter of the Depth First Search tree (DFS) of the… (More)


1 Figure or Table

Slides referencing similar topics