Now showing items 1-1 of 1

    • Secure combinatorial optimization using DFS-based variable elimination 

      Silaghi, Marius Cӑlin; Petcu, Adrian; Faltings, Boi (2005-08-22)
      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 ...