-
1
المؤلفون: Eric Allender, John Gouwar, Shuichi Hirahara, Caleb Robelle
مصطلحات موضوعية: Theory of computation ��� Circuit complexity, General Computer Science, Minimum Circuit Size Problem, Kolmogorov Complexity, Computer Science, Theory of computation ��� Problems, reductions and completeness, Interactive Proofs, Theory of computation ��� Complexity classes, Worst-Case to Average-Case Reductions, Theoretical Computer Science
-
2Academic Journal
المؤلفون: Impagliazzo, Russell, Kabanets, Valentine, Volkovich, Ilya
المساهمون: Russell Impagliazzo and Valentine Kabanets and Ilya Volkovich
مصطلحات موضوعية: Minimal Circuit Size Problem (MCSP), Circuit Lower Bounds, Complexity Classes, Indistinguishability Obfuscation, Separation of Classes, Statistical Distance
وصف الملف: 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.31
-
3Academic Journal
المؤلفون: Austrin, Per, Risse, Kilian
المساهمون: Per Austrin and Kilian Risse
مصطلحات موضوعية: Proof Complexity, Sum of Squares, Minimum Circuit Size Problem
وصف الملف: application/pdf
Relation: Is Part Of LIPIcs, Volume 264, 38th Computational Complexity Conference (CCC 2023); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2023.31
-
4Academic Journal
المؤلفون: Hirahara, Shuichi, Moshkovitz, Dana
المساهمون: Shuichi Hirahara and Dana Moshkovitz
مصطلحات موضوعية: PCP theorem, regularization, Minimum Circuit Size Problem
وصف الملف: application/pdf
Relation: Is Part Of LIPIcs, Volume 283, 34th International Symposium on Algorithms and Computation (ISAAC 2023); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2023.39
-
5Academic Journal
المؤلفون: Santhanam, Rahul
المساهمون: Rahul Santhanam
مصطلحات موضوعية: Minimum Circuit Size Problem, Satisfiability, Cryptography, Learning, Approximation
وصف الملف: application/pdf
Relation: Is Part Of LIPIcs, Volume 250, 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2022); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2022.2
-
6Academic Journal
المؤلفون: Ren, Hanlin, Santhanam, Rahul
المساهمون: Hanlin Ren and Rahul Santhanam
مصطلحات موضوعية: meta-complexity, relativization, minimum circuit size problem
وصف الملف: application/pdf
Relation: Is Part Of LIPIcs, Volume 219, 39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2022.54
-
7Academic Journal
المؤلفون: Chia, Nai-Hui, Chou, Chi-Ning, Zhang, Jiayu, Zhang, Ruizhe
المساهمون: Nai-Hui Chia and Chi-Ning Chou and Jiayu Zhang and Ruizhe Zhang
مصطلحات موضوعية: Quantum Computation, Quantum Complexity, Minimum Circuit Size Problem
وصف الملف: application/pdf
Relation: Is Part Of LIPIcs, Volume 215, 13th Innovations in Theoretical Computer Science Conference (ITCS 2022); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2022.47
-
8Academic Journal
المؤلفون: Peng Xu, Longyun Kang, Di Xie, Xuan Luo, Hongye Lin
المصدر: Batteries; Volume 8; Issue 6; Pages: 53
مصطلحات موضوعية: battery equalizers, multicell-to-multicell (MC2MC) equalizers, LC converter, voltage consistency, circuit size
وصف الملف: application/pdf
-
9
المؤلفون: Lingas, Andrzej
المساهمون: Gasieniec, Leszek, Editor
المصدر: 48th International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2023,Nový Smokovec, Slovakia,-- SOFSEM 2023 : Theory and Practice of Computer Science - 48th International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2023, Proceedings - Theory and Practice of Computer Science - 48th International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2023, Proceedings. 13878 LNCS:301-312
مصطلحات موضوعية: Circuit size, Monotone arithmetic circuit, Monotone Boolean circuit, Monotone multilinear Boolean circuit, Teknik, Elektroteknik och elektronik, Engineering and Technology, Electrical Engineering, Electronic Engineering, Information Engineering
URL الوصول: https://lup.lub.lu.se/record/1232e54a-59a5-453f-a66c-9bd4cb0c1121
http://dx.doi.org/10.1007/978-3-031-23101-8_20 -
10Academic Journal
المؤلفون: 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
-
11Academic Journal
المؤلفون: Carmosino, Marco, Hoover, Kenneth, Impagliazzo, Russell, Kabanets, Valentine, Kolokolova, Antonina
المساهمون: Marco Carmosino and Kenneth Hoover and Russell Impagliazzo and Valentine Kabanets and Antonina Kolokolova
مصطلحات موضوعية: circuit complexity, constant-depth circuits, lifting theorems, Minimum Circuit Size Problem, reductions, Switching Lemma
وصف الملف: application/pdf
Relation: Is Part Of LIPIcs, Volume 198, 48th International Colloquium on Automata, Languages, and Programming (ICALP 2021); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2021.44
-
12Academic Journal
المساهمون: Mahdi Cheraghchi and Shuichi Hirahara and Dimitrios Myrisiotis and Yuichi Yoshida
مصطلحات موضوعية: Minimum Circuit Size Problem, Kolmogorov Complexity, One-Tape Turing Machines, Branching Programs, Lower Bounds, Pseudorandom Generators, Hitting Set Generators
وصف الملف: application/pdf
Relation: Is Part Of LIPIcs, Volume 187, 38th International Symposium on Theoretical Aspects of Computer Science (STACS 2021); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2021.23
-
13Conference
المؤلفون: Järvinen, K., Leppäkoski, H., Lohan, E., Richter, P., Schneider, T., Tkachenko, O., Yang, Z.
المساهمون: Department of Computer Science
مصطلحات موضوعية: indoor communication, location based services, outsourcing, protocols, RSSI, location-based services, privacy-preserving LBS, circuit building blocks, single instruction multiple data, PPIL protocol, practical privacy-preserving indoor localization using outsourcing, noncolluding semihonest parties, Wi-Fi fingerprint-based PPIL, research areas indoor localization, indoor LBS, indoor environments, circuit size, depth-optimized circuits, two-party computation protocols, Wireless fidelity, Privacy, Servers, Databases, Encryption, location privacy, indoor localization, secure multi party computation, Computer and information sciences
وصف الملف: application/pdf
Relation: 2019 IEEE European Symposium on Security and Privacy (EuroS P); Järvinen , K , Leppäkoski , H , Lohan , E , Richter , P , Schneider , T , Tkachenko , O & Yang , Z 2019 , PILOT : Practical Privacy-Preserving Indoor Localization Using OuTsourcing . in 2019 IEEE European Symposium on Security and Privacy (EuroS P) . IEEE , pp. 448-463 , 2019 IEEE European Symposium on Security and Privacy , Stockholm , Sweden , 17/06/2019 . https://doi.org/10.1109/EuroSP.2019.00040; conference; Bibtex: 8806758; http://hdl.handle.net/10138/309765; 09cf1091-a942-4e49-9b51-566a1f272039; 000568610300030
الاتاحة: http://hdl.handle.net/10138/309765
-
14Academic Journal
المؤلفون: Saks, Michael, Santhanam, Rahul
المساهمون: Michael Saks and Rahul Santhanam
مصطلحات موضوعية: Minimum Circuit Size Problem, Turing reductions, circuit lower bounds
وصف الملف: application/pdf
Relation: Is Part Of LIPIcs, Volume 169, 35th Computational Complexity Conference (CCC 2020); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2020.26
-
15Academic Journal
المؤلفون: Ilango, Rahul
المساهمون: Rahul Ilango
مصطلحات موضوعية: minimum circuit size problem, minimum formula size problem, gate elimination, search to decision reduction, self-reducibility
وصف الملف: application/pdf
Relation: Is Part Of LIPIcs, Volume 169, 35th Computational Complexity Conference (CCC 2020); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2020.31
-
16Academic Journal
المؤلفون: Chen, Lijie, Hirahara, Shuichi, Oliveira, Igor C., Pich, Ján, Rajgopal, Ninad, Santhanam, Rahul
المساهمون: Lijie Chen and Shuichi Hirahara and Igor C. Oliveira and Ján Pich and Ninad Rajgopal and Rahul Santhanam
مصطلحات موضوعية: Hardness Magnification, Natural Proofs, Minimum Circuit Size Problem, Circuit Lower Bounds
وصف الملف: application/pdf
Relation: Is Part Of LIPIcs, Volume 151, 11th Innovations in Theoretical Computer Science Conference (ITCS 2020); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2020.70
-
17Academic Journal
المؤلفون: Santhanam, Rahul
المساهمون: Rahul Santhanam
مصطلحات موضوعية: Minimum Circuit Size Problem, Pseudorandomness, Average-case Complexity, Natural Proofs, Universality Conjecture
وصف الملف: application/pdf
Relation: Is Part Of LIPIcs, Volume 151, 11th Innovations in Theoretical Computer Science Conference (ITCS 2020); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2020.68
-
18Academic Journal
المؤلفون: Ilango, Rahul
المساهمون: Rahul Ilango
مصطلحات موضوعية: Minimum Circuit Size Problem, reductions, NP-completeness, circuit lower bounds
وصف الملف: application/pdf
Relation: Is Part Of LIPIcs, Volume 151, 11th Innovations in Theoretical Computer Science Conference (ITCS 2020); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2020.34
-
19Academic Journal
المؤلفون: Oliveira, Igor Carboni, Pich, Ján, Santhanam, Rahul
المساهمون: Igor Carboni Oliveira and Ján Pich and Rahul Santhanam
مصطلحات موضوعية: Circuit Complexity, Minimum Circuit Size Problem, Kolmogorov Complexity
وصف الملف: application/pdf
Relation: Is Part Of LIPIcs, Volume 137, 34th Computational Complexity Conference (CCC 2019); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2019.27
-
20Academic Journal
المؤلفون: Golovnev, Alexander, Ilango, Rahul, Impagliazzo, Russell, Kabanets, Valentine, Kolokolova, Antonina, Tal, Avishay
المساهمون: Alexander Golovnev and Rahul Ilango and Russell Impagliazzo and Valentine Kabanets and Antonina Kolokolova and Avishay Tal
مصطلحات موضوعية: Minimum Circuit Size Problem (MCSP), circuit lower bounds, AC0[p], coin problem, hybrid argument, MKTP, biased random boolean functions
وصف الملف: application/pdf
Relation: Is Part Of LIPIcs, Volume 132, 46th International Colloquium on Automata, Languages, and Programming (ICALP 2019); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2019.66