Go to the corresponding LIPIcs Volume Portal 
Allender, Eric ; Cheraghchi, Mahdi ; Myrisiotis, Dimitrios ; Tirumala, Harsha ; Volkovich, Ilya
pdfformat: 

@InProceedings{allender_et_al:LIPIcs.FSTTCS.2021.7, author = {Allender, Eric and Cheraghchi, Mahdi and Myrisiotis, Dimitrios and Tirumala, Harsha and Volkovich, Ilya}, title = {{OneWay Functions and a Conditional Variant of MKTP}}, booktitle = {41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2021)}, pages = {7:17:19}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783959772150}, ISSN = {18688969}, year = {2021}, volume = {213}, editor = {Boja\'{n}czy, Miko{\l}aj and Chekuri, Chandra}, publisher = {Schloss Dagstuhl  LeibnizZentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/opus/volltexte/2021/15518}, URN = {urn:nbn:de:0030drops155181}, doi = {10.4230/LIPIcs.FSTTCS.2021.7}, annote = {Keywords: Kolmogorov complexity, KT Complexity, Minimum KTcomplexity Problem, MKTP, Conditional KT Complexity, Minimum Conditional KTcomplexity Problem, McKTP, oneway functions, OWFs, averagecase hardness, pseudorandom generators, PRGs, pseudorandom functions, PRFs, distinguishers, learning algorithms, NPcompleteness, reductions} }
Keywords:  Kolmogorov complexity, KT Complexity, Minimum KTcomplexity Problem, MKTP, Conditional KT Complexity, Minimum Conditional KTcomplexity Problem, McKTP, oneway functions, OWFs, averagecase hardness, pseudorandom generators, PRGs, pseudorandom functions, PRFs, distinguishers, learning algorithms, NPcompleteness, reductions  
Collection:  41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2021)  
Issue Date:  2021  
Date of publication:  29.11.2021 