Gotowa bibliografia na temat „Certificate complexity”
Utwórz poprawne odniesienie w stylach APA, MLA, Chicago, Harvard i wielu innych
Zobacz listy aktualnych artykułów, książek, rozpraw, streszczeń i innych źródeł naukowych na temat „Certificate complexity”.
Przycisk „Dodaj do bibliografii” jest dostępny obok każdej pracy w bibliografii. Użyj go – a my automatycznie utworzymy odniesienie bibliograficzne do wybranej pracy w stylu cytowania, którego potrzebujesz: APA, MLA, Harvard, Chicago, Vancouver itp.
Możesz również pobrać pełny tekst publikacji naukowej w formacie „.pdf” i przeczytać adnotację do pracy online, jeśli odpowiednie parametry są dostępne w metadanych.
Artykuły w czasopismach na temat "Certificate complexity"
Aaronson, Scott. "Quantum certificate complexity". Journal of Computer and System Sciences 74, nr 3 (maj 2008): 313–22. http://dx.doi.org/10.1016/j.jcss.2007.06.020.
Pełny tekst źródłaAmbainis, A., A. M. Childs, F. Le Gall i S. Tani. "The quantum query complexity of certification". Quantum Information and Computation 10, nr 3&4 (marzec 2010): 181–89. http://dx.doi.org/10.26421/qic10.3-4-1.
Pełny tekst źródłaYan, Junzhi, Na Li, Bo Yang, Min Li, Li Su i Shen He. "Decentralized Certificate Management for Network Function Virtualisation (NFV) Implementation in Telecommunication Networks". Wireless Communications and Mobile Computing 2021 (18.10.2021): 1–10. http://dx.doi.org/10.1155/2021/6985492.
Pełny tekst źródłaHe, Kun, Qian Li i Xiaoming Sun. "A tighter relation between sensitivity complexity and certificate complexity". Theoretical Computer Science 762 (marzec 2019): 1–12. http://dx.doi.org/10.1016/j.tcs.2018.08.025.
Pełny tekst źródłaČepek, Ondřej, Petr Kučera i Petr Savický. "Boolean functions with a simple certificate for CNF complexity". Discrete Applied Mathematics 160, nr 4-5 (marzec 2012): 365–82. http://dx.doi.org/10.1016/j.dam.2011.05.013.
Pełny tekst źródłaSchuch, Norbert. "Complexity of commuting Hamiltonians on a square lattice of qubits". Quantum Information and Computation 11, nr 11&12 (listopad 2011): 901–12. http://dx.doi.org/10.26421/qic11.11-12-1.
Pełny tekst źródłaNieradko-Iwanicka, Barbara, i Janusz Iwanicki. "Musculoskeletal diseases as the basis for issuing disability certificates for children". Rheumatology 61, nr 2 (10.05.2023): 97–103. http://dx.doi.org/10.5114/reum/163095.
Pełny tekst źródłaD R, Hari Krishnan. "Certification and Attestation Genuinity Management System". International Journal for Research in Applied Science and Engineering Technology 10, nr 6 (30.06.2022): 3247–54. http://dx.doi.org/10.22214/ijraset.2022.44522.
Pełny tekst źródłaPutri, Eko Kurnia, i Argo Pambudi. "INOVASI PELAYANAN AKTA KELAHIRAN MELALUI EGOVERNMENT DI DINAS KEPENDUDUKAN DAN PENCATATAN SIPIL KOTA YOGYAKARTA". NATAPRAJA 6, nr 1 (6.08.2018): 69. http://dx.doi.org/10.21831/jnp.v6i1.20740.
Pełny tekst źródłaK.C, Amir, Harri Forsgren, Kaj Grahn, Timo Karvi i Göran Pulkkis. "Security and Trust of Public Key Cryptography for HIP and HIP Multicast". International Journal of Dependable and Trustworthy Information Systems 2, nr 3 (lipiec 2011): 17–35. http://dx.doi.org/10.4018/jdtis.2011070102.
Pełny tekst źródłaRozprawy doktorskie na temat "Certificate complexity"
Tsagari, Dina. "The complexity of test washback an empirical study". Frankfurt, M. Berlin Bern Bruxelles New York, NY Oxford Wien Lang, 2007. http://d-nb.info/994779968/04.
Pełny tekst źródłaSunny, Anupa. "Complexity measures through the lens of two-player games and signatures of the hypercube". Electronic Thesis or Diss., Université Paris Cité, 2023. http://www.theses.fr/2023UNIP7070.
Pełny tekst źródłaComplexity measures of Boolean functions capture various aspects of the hardness of computing a function and their study is about finding connections between different complexity measures. In the first part of this thesis, we introduce and study Certificate Game complexity, a measure of complexity based on the probability of winning a game in which two players are given inputs with different function values and are asked to output some index i where their inputs differ, in a zero-communication setting. We give upper and lower bounds for private coin, public coin, shared entanglement and non-signaling strategies, and give some separations. We show that complexity in the public coin model is bounded above by Randomised query and Certificate complexities. On the other hand, it is bounded below by fractional certificate complexity, making it a good candidate to prove strong lower bounds on randomised query complexity. Complexity in the private coin model is bounded below by zero-error randomised query complexity. The quantum measure highlights an interesting and surprising difference between classical and quantum query models. While public coin certificate game complexity is bounded above by randomised query complexity, quantum certificate game complexity can be quadratically larger than quantum query complexity. We use non-signaling, a notion from quantum information, to give a lower bound of n on the quantum certificate game complexity of the OR function, whose quantum query complexity is Θ(√n) and then go on to show that this "non-signaling bottleneck" applies to all functions with high sensitivity, block sensitivity or fractional block sensitivity. We also consider the single-bit version of certificate games, where the inputs of the two players are restricted to having Hamming distance 1. We prove that the single-bit version of certificate game complexity with shared randomness is equal to sensitivity up to constant factors, thus giving a new characterization of sensitivity. On the other hand, the single-bit version of certificate game complexity with private randomness is equal to λ2, where λ is the spectral sensitivity. In the second part of this thesis, we revisit the celebrated proof of the sensitivity conjecture by Hao Huang. Using spectral techniques, Huang proved that every subgraph of the hypercube Hn of dimension n induced on more than half the vertices has maximum degree at least √n. Combined with earlier work, this completed a proof of the sensitivity conjecture. We show an alternate proof of Huang's result using only linear dependency of vectors associated with the vertices of the hypercube. Our approach helps gain insight on more structural properties of the induced subgraph in addition to the largest degree. In particular, we prove that in any induced subgraph of Hn with more than half the number of vertices, there are two vertices, one of odd parity and the other of even parity, each with at least n vertices at distance at most 2. As an application, we show that for any Boolean function f, the polynomial degree is bounded above by the product of 0-sensitivity and 1-sensitivity, s0(f)s1(f), a strictly stronger statement which implies Huang's theorem. We also obtain structural relations for induced subgraphs at distance 3. A key implement in Huang's proof was signed hypercubes with the property that every cycle of length 4 is assigned a negative sign. We take a detailed look at this signature and give a nearly optimal signature that uses the minimum number of negative edges while ensuring that every 4-cycle is negative. This problem turns out to be related to one of Erdös' problems on the largest 4-cycle free subgraph of the hypercube
WEGLEAU, SERGE. "Le certificat medical pour coups et blessures volontaires : sa complexite". Lille 2, 1988. http://www.theses.fr/1988LIL2M129.
Pełny tekst źródłaArkoudas, Konstantine. "Simplifying transformations for type-alpha certificates". 2001. http://hdl.handle.net/1721.1/6680.
Pełny tekst źródłaRothe, Jörg [Verfasser]. "Complexity of certificates, heuristics, and counting types, with applications to cryptography and circuit theory / von Jörg-Matthias Rothe". 1999. http://d-nb.info/982741014/34.
Pełny tekst źródłaCzęści książek na temat "Certificate complexity"
Hellerstein, Lisa. "Certificate Complexity and Exact Learning". W Encyclopedia of Algorithms, 286–90. New York, NY: Springer New York, 2016. http://dx.doi.org/10.1007/978-1-4939-2864-4_66.
Pełny tekst źródłaHellerstein, Lisa. "Certificate Complexity and Exact Learning". W Encyclopedia of Algorithms, 1–5. Boston, MA: Springer US, 2015. http://dx.doi.org/10.1007/978-3-642-27848-8_66-2.
Pełny tekst źródłaHellerstein, Lisa. "Certificate Complexity and Exact Learning". W Encyclopedia of Algorithms, 131–34. Boston, MA: Springer US, 2008. http://dx.doi.org/10.1007/978-0-387-30162-4_66.
Pełny tekst źródłaHe, Kun, Qian Li i Xiaoming Sun. "A Tighter Relation Between Sensitivity Complexity and Certificate Complexity". W Lecture Notes in Computer Science, 262–74. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-62389-4_22.
Pełny tekst źródłaAmbainis, Andris, Krišjānis Prūsis i Jevgēnijs Vihrovs. "Sensitivity Versus Certificate Complexity of Boolean Functions". W Computer Science – Theory and Applications, 16–28. Cham: Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-34171-2_2.
Pełny tekst źródłaBerbecaru, Diana, Antonio Lioy i Marius Marian. "On the Complexity of Public-Key Certificate Validation". W Lecture Notes in Computer Science, 183–203. Berlin, Heidelberg: Springer Berlin Heidelberg, 2001. http://dx.doi.org/10.1007/3-540-45439-x_13.
Pełny tekst źródłaMorizumi, Hiroki. "Sensitivity, Block Sensitivity, and Certificate Complexity of Unate Functions and Read-Once Functions". W Advanced Information Systems Engineering, 104–10. Berlin, Heidelberg: Springer Berlin Heidelberg, 2014. http://dx.doi.org/10.1007/978-3-662-44602-7_9.
Pełny tekst źródłaAmbainis, Andris, i Krišjānis Prūsis. "A Tight Lower Bound on Certificate Complexity in Terms of Block Sensitivity and Sensitivity". W Mathematical Foundations of Computer Science 2014, 33–44. Berlin, Heidelberg: Springer Berlin Heidelberg, 2014. http://dx.doi.org/10.1007/978-3-662-44465-8_4.
Pełny tekst źródłaAkshay, S., Krishnendu Chatterjee, Tobias Meggendorfer i Đorđe Žikelić. "MDPs as Distribution Transformers: Affine Invariant Synthesis for Safety Objectives". W Computer Aided Verification, 86–112. Cham: Springer Nature Switzerland, 2023. http://dx.doi.org/10.1007/978-3-031-37709-9_5.
Pełny tekst źródłaChen, Xiaohong, Zhengyao Lin, Minh-Thai Trinh i Grigore Roşu. "Towards a Trustworthy Semantics-Based Language Framework via Proof Generation". W Computer Aided Verification, 477–99. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-81688-9_23.
Pełny tekst źródłaStreszczenia konferencji na temat "Certificate complexity"
Wirz, Victor Hugo, i Pedro Nuno Moura. "An Introduction to the Complexity Class of Pure Nash Equilibrium". W Encontro de Teoria da Computação. Sociedade Brasileira de Computação - SBC, 2023. http://dx.doi.org/10.5753/etc.2023.229527.
Pełny tekst źródłaAmmon, Sabine, Alexandra Kljagin, Juliane Rettschlag i Martina Vortel. "The Berlin ethics certificate: conceptualizing interdisciplinarity as a core building block of ethics in engineering education". W SEFI 50th Annual conference of The European Society for Engineering Education. Barcelona: Universitat Politècnica de Catalunya, 2022. http://dx.doi.org/10.5821/conference-9788412322262.1422.
Pełny tekst źródłaHigley, James B., David A. McLees i Mohammad A. Zahraee. "A Case Study in Laboratory-Based Online Courses: Teaching CNC Programming". W ASME 2003 International Mechanical Engineering Congress and Exposition. ASMEDC, 2003. http://dx.doi.org/10.1115/imece2003-42204.
Pełny tekst źródłaLiebenberg, Marais, Claudia C. Magalha˜es i David Eduardo G. P. Bueno. "On the Design of an Operator Training Simulator in a South African Pipeline Network". W 2008 7th International Pipeline Conference. ASMEDC, 2008. http://dx.doi.org/10.1115/ipc2008-64527.
Pełny tekst źródłaNita, Stefania loredana, i Marius iulian Mihailescu. "PROPOSING A SECURE FRAMEWORK FOR ELEARNING PLATFORMS USING ATTRIBUTE BASED ENCRYPTION". W eLSE 2017. Carol I National Defence University Publishing House, 2017. http://dx.doi.org/10.12753/2066-026x-17-102.
Pełny tekst źródłaLyon, Tim S., i Lucía Gómez Álvarez. "Automating Reasoning with Standpoint Logic via Nested Sequents". W 19th International Conference on Principles of Knowledge Representation and Reasoning {KR-2022}. California: International Joint Conferences on Artificial Intelligence Organization, 2022. http://dx.doi.org/10.24963/kr.2022/26.
Pełny tekst źródłaZhang, Haitao, i Ke Li. "Predicting the Risk of Twist-Off for Rotary Shouldered Threaded Connections With a Statistical Approach". W ASME 2019 International Mechanical Engineering Congress and Exposition. American Society of Mechanical Engineers, 2019. http://dx.doi.org/10.1115/imece2019-11061.
Pełny tekst źródła