{"publication_identifier":{"issn":["03029743"]},"author":[{"first_name":"Maciej","last_name":"Skórski","id":"EC09FA6A-02D0-11E9-8223-86B7C91467DD","full_name":"Skórski, Maciej"}],"page":"586 - 599","doi":"10.1007/978-3-319-55911-7_42","_id":"650","language":[{"iso":"eng"}],"editor":[{"last_name":"Jäger","first_name":"Gerhard","full_name":"Jäger, Gerhard"},{"last_name":"Steila","first_name":"Silvia","full_name":"Steila, Silvia"}],"citation":{"short":"M. Skórski, in:, G. Jäger, S. Steila (Eds.), Springer, 2017, pp. 586–599.","ama":"Skórski M. A cryptographic view of regularity lemmas: Simpler unified proofs and refined bounds. In: Jäger G, Steila S, eds. Vol 10185. Springer; 2017:586-599. doi:<a href=\"https://doi.org/10.1007/978-3-319-55911-7_42\">10.1007/978-3-319-55911-7_42</a>","apa":"Skórski, M. (2017). A cryptographic view of regularity lemmas: Simpler unified proofs and refined bounds. In G. Jäger &#38; S. Steila (Eds.) (Vol. 10185, pp. 586–599). Presented at the TAMC: Theory and Applications of Models of Computation, Bern, Switzerland: Springer. <a href=\"https://doi.org/10.1007/978-3-319-55911-7_42\">https://doi.org/10.1007/978-3-319-55911-7_42</a>","ista":"Skórski M. 2017. A cryptographic view of regularity lemmas: Simpler unified proofs and refined bounds. TAMC: Theory and Applications of Models of Computation, LNCS, vol. 10185, 586–599.","chicago":"Skórski, Maciej. “A Cryptographic View of Regularity Lemmas: Simpler Unified Proofs and Refined Bounds.” edited by Gerhard Jäger and Silvia Steila, 10185:586–99. Springer, 2017. <a href=\"https://doi.org/10.1007/978-3-319-55911-7_42\">https://doi.org/10.1007/978-3-319-55911-7_42</a>.","ieee":"M. Skórski, “A cryptographic view of regularity lemmas: Simpler unified proofs and refined bounds,” presented at the TAMC: Theory and Applications of Models of Computation, Bern, Switzerland, 2017, vol. 10185, pp. 586–599.","mla":"Skórski, Maciej. <i>A Cryptographic View of Regularity Lemmas: Simpler Unified Proofs and Refined Bounds</i>. Edited by Gerhard Jäger and Silvia Steila, vol. 10185, Springer, 2017, pp. 586–99, doi:<a href=\"https://doi.org/10.1007/978-3-319-55911-7_42\">10.1007/978-3-319-55911-7_42</a>."},"conference":{"location":"Bern, Switzerland","end_date":"2017-04-22","start_date":"2017-04-20","name":"TAMC: Theory and Applications of Models of Computation"},"year":"2017","intvolume":"     10185","volume":10185,"publist_id":"7119","month":"01","date_updated":"2021-01-12T08:07:46Z","type":"conference","day":"01","department":[{"_id":"KrPi"}],"main_file_link":[{"open_access":"1","url":"https://eprint.iacr.org/2016/965.pdf"}],"abstract":[{"text":"In this work we present a short and unified proof for the Strong and Weak Regularity Lemma, based on the cryptographic tech-nique called low-complexity approximations. In short, both problems reduce to a task of finding constructively an approximation for a certain target function under a class of distinguishers (test functions), where dis-tinguishers are combinations of simple rectangle-indicators. In our case these approximations can be learned by a simple iterative procedure, which yields a unified and simple proof, achieving for any graph with density d and any approximation parameter the partition size. The novelty in our proof is: (a) a simple approach which yields both strong and weaker variant, and (b) improvements when d = o(1). At an abstract level, our proof can be seen a refinement and simplification of the “analytic” proof given by Lovasz and Szegedy.","lang":"eng"}],"publication_status":"published","date_published":"2017-01-01T00:00:00Z","publisher":"Springer","scopus_import":1,"oa_version":"Submitted Version","oa":1,"date_created":"2018-12-11T11:47:42Z","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","alternative_title":["LNCS"],"title":"A cryptographic view of regularity lemmas: Simpler unified proofs and refined bounds","quality_controlled":"1","status":"public"}