Abstract: We give a deterministic $m^{1+o(1)}$ time algorithm that computes exact maximum flows and minimum-cost flows on directed graphs with m edges and ...
Non-deterministic symmetric encryption communication system based on generative adversarial networks
Abstract: Symmetric encryption algorithms learned by the previous proposed end-to-end adversarial network encryption communication systems are deterministic. With the same key and same plaintext, the ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback