المؤلفون: Allender, Eric, Gray, Jacob, Mutreja, Saachi, Tirumala, Harsha, Wang, Pengxiang

المساهمون: Eric Allender and Jacob Gray and Saachi Mutreja and Harsha Tirumala and Pengxiang Wang

مصطلحات موضوعية: Interactive Proofs

وصف الملف: application/pdf

Relation: Is Part Of LIPIcs, Volume 275, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2023); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2023.56

الاتاحة: https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2023.56
https://nbn-resolving.org/urn:nbn:de:0030-drops-188815
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2023.56

المؤلفون: Allender, Eric, Hirahara, Shuichi, Tirumala, Harsha

المساهمون: Eric Allender and Shuichi Hirahara and Harsha Tirumala

مصطلحات موضوعية: Kolmogorov Complexity, Interactive Proofs

وصف الملف: application/pdf

Relation: Is Part Of LIPIcs, Volume 251, 14th Innovations in Theoretical Computer Science Conference (ITCS 2023); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2023.3

الاتاحة: https://doi.org/10.4230/LIPIcs.ITCS.2023.3
https://nbn-resolving.org/urn:nbn:de:0030-drops-175063
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2023.3

المؤلفون: Allender, Eric, Grochow, Joshua A., van Melkebeek, Dieter, Moore, Cristopher, Morgan, Andrew

مصطلحات موضوعية: Computer Science - Computational Complexity

URL الوصول: http://arxiv.org/abs/1710.09806

المؤلفون: Allender, Eric, Gouwar, John, Hirahara, Shuichi, Robelle, Caleb

المساهمون: National Science Foundation

المصدر: Theoretical Computer Science ; volume 940, page 206-224 ; ISSN 0304-3975

الاتاحة: http://dx.doi.org/10.1016/j.tcs.2022.10.040
https://api.elsevier.com/content/article/PII:S0304397522006508?httpAccept=text/xml
https://api.elsevier.com/content/article/PII:S0304397522006508?httpAccept=text/plain

المؤلفون: Allender, Eric, Grochow, Joshua A., van Melkebeek, Dieter, Moore, Cristopher, Morgan, Andrew

مصطلحات موضوعية: Computer Science - Computational Complexity

URL الوصول: http://arxiv.org/abs/1511.08189

المؤلفون: Allender, Eric, Buhrman, Harry, Friedman, Luke, Loff, Bruno

المصدر: Logical Methods in Computer Science, Volume 10, Issue 3 (August 19, 2014) lmcs:723

مصطلحات موضوعية: Computer Science - Computational Complexity, Computer Science - Logic in Computer Science

URL الوصول: http://arxiv.org/abs/1406.7658

المؤلفون: Allender, Eric Warren

مصطلحات موضوعية: Functions

وصف الملف: 240 bytes; text/html

الاتاحة: http://hdl.handle.net/1853/8128

المؤلفون: Allender, Eric, Gouwar, John, Hirahara, Shuichi, Robelle, Caleb

المساهمون: Eric Allender and John Gouwar and Shuichi Hirahara and Caleb Robelle

مصطلحات موضوعية: Kolmogorov Complexity, Interactive Proofs, Minimum Circuit Size Problem, Worst-case to Average-case Reductions

وصف الملف: application/pdf

Relation: Is Part Of LIPIcs, Volume 212, 32nd International Symposium on Algorithms and Computation (ISAAC 2021); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2021.54

الاتاحة: https://doi.org/10.4230/LIPIcs.ISAAC.2021.54
https://nbn-resolving.org/urn:nbn:de:0030-drops-154875
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2021.54

المؤلفون: Allender, Eric, Chauhan, Archit, Datta, Samir

المساهمون: Eric Allender and Archit Chauhan and Samir Datta

مصطلحات موضوعية: Depth-First Search, Planar Digraphs, Parallel Algorithms, Space-Bounded Complexity Classes

وصف الملف: application/pdf

Relation: Is Part Of LIPIcs, Volume 202, 46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2021.7

الاتاحة: https://doi.org/10.4230/LIPIcs.MFCS.2021.7
https://nbn-resolving.org/urn:nbn:de:0030-drops-144478
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2021.7

المؤلفون: Allender, Eric, Cheraghchi, Mahdi, Myrisiotis, Dimitrios, Tirumala, Harsha, Volkovich, Ilya

المساهمون: Eric Allender and Mahdi Cheraghchi and Dimitrios Myrisiotis and Harsha Tirumala and Ilya Volkovich

مصطلحات موضوعية: Kolmogorov complexity, KT Complexity, Minimum KT-complexity Problem, MKTP, Conditional KT Complexity, Minimum Conditional KT-complexity Problem, McKTP, one-way functions, OWFs, average-case hardness, pseudorandom generators, PRGs, pseudorandom functions, PRFs, distinguishers, learning algorithms, NP-completeness, reductions

وصف الملف: application/pdf

Relation: Is Part Of LIPIcs, Volume 213, 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2021); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2021.7

الاتاحة: https://doi.org/10.4230/LIPIcs.FSTTCS.2021.7
https://nbn-resolving.org/urn:nbn:de:0030-drops-155181
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2021.7

المؤلفون: Allender, Eric, Farach-Colton, Martín, Tsai, Meng-Tsung

المساهمون: Eric Allender and Martín Farach-Colton and Meng-Tsung Tsai

مصطلحات موضوعية: Syntactic Class, Exponential Time Hypothesis, APX, PTAS

وصف الملف: application/pdf

Relation: Is Part Of LIPIcs, Volume 145, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2019)

الاتاحة: https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2019.16
https://nbn-resolving.org/urn:nbn:de:0030-drops-112319
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2019.16

المؤلفون: Allender, Eric, Chauhan, Archit, Datta, Samir

المصدر: Acta Informatica. 59:289-319

مصطلحات موضوعية: Computer Networks and Communications, Theory of computation → Parallel algorithms, Parallel Algorithms, Space-Bounded Complexity Classes, Depth-First Search, Planar Digraphs, Theory of computation → Complexity classes, Software, Information Systems

URL الوصول: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::71cc1a4ef2c11b520763a9bfde80fc9a
https://doi.org/10.1007/s00236-022-00425-1

المؤلفون: Allender, Eric, Grochow, Joshua A., van Melkebeek, Dieter, Moore, Cristopher, Morgan, Andrew

المساهمون: Eric Allender and Joshua A. Grochow and Dieter van Melkebeek and Cristopher Moore and Andrew Morgan

مصطلحات موضوعية: Reductions between NP-intermediate problems, Graph Isomorphism, Minimum Circuit Size Problem, time-bounded Kolmogorov complexity

وصف الملف: application/pdf

Relation: Is Part Of LIPIcs, Volume 94, 9th Innovations in Theoretical Computer Science Conference (ITCS 2018); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2018.20

الاتاحة: https://doi.org/10.4230/LIPIcs.ITCS.2018.20
https://nbn-resolving.org/urn:nbn:de:0030-drops-83455
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2018.20

المؤلفون: Eric Allender and Jacob Gray and Saachi Mutreja and Harsha Tirumala and Pengxiang Wang, Allender, Eric, Gray, Jacob, Mutreja, Saachi, Tirumala, Harsha, Wang, Pengxiang

مصطلحات الفهرس: Interactive Proofs, InProceedings, Text, doc-type:ResearchArticle, publishedVersion

URL: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2023.56
Is Part Of LIPIcs, Volume 275, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2023)

المؤلفون: Eric Allender and Shuichi Hirahara and Harsha Tirumala, Allender, Eric, Hirahara, Shuichi, Tirumala, Harsha

مصطلحات الفهرس: Kolmogorov Complexity, Interactive Proofs, InProceedings, Text, doc-type:ResearchArticle, publishedVersion

URL: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2023.3
Is Part Of LIPIcs, Volume 251, 14th Innovations in Theoretical Computer Science Conference (ITCS 2023)

المؤلفون: Allender, Eric, Mertz, Ian

المساهمون: NSF, REU

المصدر: Journal of Computer and System Sciences ; volume 104, page 5-16 ; ISSN 0022-0000

الاتاحة: http://dx.doi.org/10.1016/j.jcss.2016.10.005
https://api.elsevier.com/content/article/PII:S0022000016301015?httpAccept=text/xml
https://api.elsevier.com/content/article/PII:S0022000016301015?httpAccept=text/plain

المؤلفون: Allender, Eric, Hirahara, Shuichi

المساهمون: National Science Foundation, JSPS KAKENHI

المصدر: ACM Transactions on Computation Theory ; volume 11, issue 4, page 1-27 ; ISSN 1942-3454 1942-3462

الاتاحة: http://dx.doi.org/10.1145/3349616
https://dl.acm.org/doi/pdf/10.1145/3349616

المؤلفون: Allender, Eric

المصدر: ACM SIGACT News ; volume 54, issue 1, page 63-81 ; ISSN 0163-5700

الاتاحة: http://dx.doi.org/10.1145/3586165.3586175
https://dl.acm.org/doi/pdf/10.1145/3586165.3586175

المؤلفون: Allender, Eric, Hirahara, Shuichi

المساهمون: Eric Allender and Shuichi Hirahara

مصطلحات موضوعية: computational complexity, Kolmogorov complexity, circuit size

وصف الملف: application/pdf

Relation: Is Part Of LIPIcs, Volume 83, 42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2017.54

الاتاحة: https://doi.org/10.4230/LIPIcs.MFCS.2017.54
https://nbn-resolving.org/urn:nbn:de:0030-drops-80636
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2017.54

المؤلفون: Allender, Eric, Krebs, Andreas, McKenzie, Pierre

المساهمون: Eric Allender and Andreas Krebs and Pierre McKenzie

مصطلحات موضوعية: computational complexity, cost registers

وصف الملف: application/pdf

Relation: Is Part Of LIPIcs, Volume 83, 42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2017.24

الاتاحة: https://doi.org/10.4230/LIPIcs.MFCS.2017.24
https://nbn-resolving.org/urn:nbn:de:0030-drops-80661
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2017.24