Relevant bibliographies by topics / Certificate complexity

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Book chapters
  4. Conference papers

Academic literature on the topic 'Certificate complexity'

Author: Grafiati
Published: 20 April 2024

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Certificate complexity.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Certificate complexity"

1

Aaronson, Scott. "Quantum certificate complexity." Journal of Computer and System Sciences 74, no. 3 (2008): 313–22. http://dx.doi.org/10.1016/j.jcss.2007.06.020.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Ambainis, A., A. M. Childs, F. Le Gall, and S. Tani. "The quantum query complexity of certification." Quantum Information and Computation 10, no. 3&4 (2010): 181–89. http://dx.doi.org/10.26421/qic10.3-4-1.

Full text
Abstract:
We study the quantum query complexity of finding a certificate for a d-regular, k-level balanced \nand formula. We show that the query complexity is $\tilde\Theta(d^{(k+1)/2})$ for 0-certificates, and $\tilde\Theta(d^{k/2})$ for 1-certificates. In particular, this shows that the zero-error quantum query complexity of evaluating such formulas is $\tilde O(d^{(k+1)/2})$. Our lower bound relies on the fact that the quantum adversary method obeys a direct sum theorem.
APA, Harvard, Vancouver, ISO, and other styles
3

Yan, Junzhi, Na Li, Bo Yang, Min Li, Li Su, and Shen He. "Decentralized Certificate Management for Network Function Virtualisation (NFV) Implementation in Telecommunication Networks." Wireless Communications and Mobile Computing 2021 (October 18, 2021): 1–10. http://dx.doi.org/10.1155/2021/6985492.

Full text
Abstract:
The certificate management complexity and cost increase when PKI technology is leveraged into Network Function Virtualisation (NFV), a significant enabling technology for 5G networks. The expected security of PKI cannot be met due to the unavailability of the certificate revocation inquiry in the telecommunication operator’s core network. This paper analyses the issues and challenges during the NFV implementation and proposes a blockchain-based decentralized NFV certificate management mechanism. During instantiation, the Virtual Network Functions (VNF) instance generates certificates according
APA, Harvard, Vancouver, ISO, and other styles
4

He, Kun, Qian Li, and Xiaoming Sun. "A tighter relation between sensitivity complexity and certificate complexity." Theoretical Computer Science 762 (March 2019): 1–12. http://dx.doi.org/10.1016/j.tcs.2018.08.025.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Čepek, Ondřej, Petr Kučera, and Petr Savický. "Boolean functions with a simple certificate for CNF complexity." Discrete Applied Mathematics 160, no. 4-5 (2012): 365–82. http://dx.doi.org/10.1016/j.dam.2011.05.013.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Schuch, Norbert. "Complexity of commuting Hamiltonians on a square lattice of qubits." Quantum Information and Computation 11, no. 11&12 (2011): 901–12. http://dx.doi.org/10.26421/qic11.11-12-1.

Full text
Abstract:
We consider the computational complexity of Hamiltonians which are sums of commuting terms acting on plaquettes in a square lattice of qubits, and we show that deciding whether the ground state minimizes the energy of each local term individually is in the complexity class NP. That is, if the ground states has this property, this can be proven using a classical certificate which can be efficiently verified on a classical computer. Different to previous results on commuting Hamiltonians, our certificate proves the existence of such a state without giving instructions on how to prepare it.
APA, Harvard, Vancouver, ISO, and other styles
7

Nieradko-Iwanicka, Barbara, and Janusz Iwanicki. "Musculoskeletal diseases as the basis for issuing disability certificates for children." Rheumatology 61, no. 2 (2023): 97–103. http://dx.doi.org/10.5114/reum/163095.

Full text
Abstract:
IntroductionThere are nearly 240 million children living with disabilities worldwide – 1 in 10 of all children. The Polish disability certification system is characterized by a significant level of complexity. At the same time the Social Insurance Institution (ZUS), Agricultural Social Insurance Fund (KRUS) and poviat/city disability adjudication teams, voivodeship disability adjudication teams/councils, the Ministry of Family and Social Policy supervising poviat and voivodeship teams/councils issue different certificates. The system is complemented by the appeals to the court which resolve co
APA, Harvard, Vancouver, ISO, and other styles
8

D R, Hari Krishnan. "Certification and Attestation Genuinity Management System." International Journal for Research in Applied Science and Engineering Technology 10, no. 6 (2022): 3247–54. http://dx.doi.org/10.22214/ijraset.2022.44522.

Full text
Abstract:
Abstract: CAGMS (Certificate and Attestation Management system) is an easy-to-use management system where any organization or individual can issue or receive digitally verifiable certificate for any type of documents / awards / rewards etc. with ease of complexity of system and technology. The system uses modern techs and high-interactive API which makes fit for all sort of organization
APA, Harvard, Vancouver, ISO, and other styles
9

Putri, Eko Kurnia, and Argo Pambudi. "INOVASI PELAYANAN AKTA KELAHIRAN MELALUI EGOVERNMENT DI DINAS KEPENDUDUKAN DAN PENCATATAN SIPIL KOTA YOGYAKARTA." NATAPRAJA 6, no. 1 (2018): 69. http://dx.doi.org/10.21831/jnp.v6i1.20740.

Full text
Abstract:
This research aimed to deeply understand the innovation and the supporting and inhibiting factors innovation of birth certificate service by E-Government. The research design used in this research were descriptive with qualitative approach. The research design was considered able to explain this research in depth. The results showed that the Innovation of Birth Certificate Services by E-Government in Yogyakarta's Department of Population and Civil Registration has not been optimal. It could be seen by the five indicators of innovation of public service according to Rogers advantages, compatibi
APA, Harvard, Vancouver, ISO, and other styles
10

K.C, Amir, Harri Forsgren, Kaj Grahn, Timo Karvi, and Göran Pulkkis. "Security and Trust of Public Key Cryptography for HIP and HIP Multicast." International Journal of Dependable and Trustworthy Information Systems 2, no. 3 (2011): 17–35. http://dx.doi.org/10.4018/jdtis.2011070102.

Full text
Abstract:
Host Identity Protocol (HIP) gives cryptographically verifiable identities to hosts. These identities are based on public key cryptography and consist of public and private keys. Public keys can be stored, together with corresponding IP addresses, in DNS servers. When entities are negotiating on a HIP connection, messages are signed with private keys and verified with public keys. Even if this system is quite secure, there is some vulnerability concerning the authenticity of public keys. The authors examine some possibilities to derive trust in public parameters. These are DNSSEC and public ke
APA, Harvard, Vancouver, ISO, and other styles

Dissertations / Theses on the topic "Certificate complexity"

1

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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Sunny, 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.

Full text
Abstract:
Les mesures de complexité des fonctions booléennes capturent divers aspects de la difficulté du calcul d'une fonction et leur étude consiste à trouver des connexions entre différentes mesures de complexité. Dans la première partie de cette thèse, nous introduisons et étudions la complexité de jeux de certificats, une mesure de complexité basée sur la probabilité de gagner un jeu dans lequel deux joueurs reçoivent des entrées avec des valeurs de fonctions différentes et doivent produire un indice i pour lequel leurs entrées diffèrent, sans communiquer. Nous donnons des bornes supérieures et inf
APA, Harvard, Vancouver, ISO, and other styles
3

WEGLEAU, SERGE. "Le certificat medical pour coups et blessures volontaires : sa complexite." Lille 2, 1988. http://www.theses.fr/1988LIL2M129.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Arkoudas, Konstantine. "Simplifying transformations for type-alpha certificates." 2001. http://hdl.handle.net/1721.1/6680.

Full text
Abstract:
This paper presents an algorithm for simplifying NDL deductions. An array of simplifying transformations are rigorously defined. They are shown to be terminating, and to respect the formal semantis of the language. We also show that the transformations never increase the size or complexity of a deduction---in the worst case, they produce deductions of the same size and complexity as the original. We present several examples of proofs containing various types of "detours", and explain how our procedure eliminates them, resulting in smaller and cleaner deductions. All of the given transformation
APA, Harvard, Vancouver, ISO, and other styles
5

Rothe, 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.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Certificate complexity"

1

Hellerstein, Lisa. "Certificate Complexity and Exact Learning." In Encyclopedia of Algorithms. Springer New York, 2016. http://dx.doi.org/10.1007/978-1-4939-2864-4_66.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Hellerstein, Lisa. "Certificate Complexity and Exact Learning." In Encyclopedia of Algorithms. Springer US, 2015. http://dx.doi.org/10.1007/978-3-642-27848-8_66-2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Hellerstein, Lisa. "Certificate Complexity and Exact Learning." In Encyclopedia of Algorithms. Springer US, 2008. http://dx.doi.org/10.1007/978-0-387-30162-4_66.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

He, Kun, Qian Li, and Xiaoming Sun. "A Tighter Relation Between Sensitivity Complexity and Certificate Complexity." In Lecture Notes in Computer Science. Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-62389-4_22.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Ambainis, Andris, Krišjānis Prūsis, and Jevgēnijs Vihrovs. "Sensitivity Versus Certificate Complexity of Boolean Functions." In Computer Science – Theory and Applications. Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-34171-2_2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Berbecaru, Diana, Antonio Lioy, and Marius Marian. "On the Complexity of Public-Key Certificate Validation." In Lecture Notes in Computer Science. Springer Berlin Heidelberg, 2001. http://dx.doi.org/10.1007/3-540-45439-x_13.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Morizumi, Hiroki. "Sensitivity, Block Sensitivity, and Certificate Complexity of Unate Functions and Read-Once Functions." In Advanced Information Systems Engineering. Springer Berlin Heidelberg, 2014. http://dx.doi.org/10.1007/978-3-662-44602-7_9.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Ambainis, Andris, and Krišjānis Prūsis. "A Tight Lower Bound on Certificate Complexity in Terms of Block Sensitivity and Sensitivity." In Mathematical Foundations of Computer Science 2014. Springer Berlin Heidelberg, 2014. http://dx.doi.org/10.1007/978-3-662-44465-8_4.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Akshay, S., Krishnendu Chatterjee, Tobias Meggendorfer, and Đorđe Žikelić. "MDPs as Distribution Transformers: Affine Invariant Synthesis for Safety Objectives." In Computer Aided Verification. Springer Nature Switzerland, 2023. http://dx.doi.org/10.1007/978-3-031-37709-9_5.

Full text
Abstract:
AbstractMarkov decision processes can be viewed as transformers of probability distributions. While this view is useful from a practical standpoint to reason about trajectories of distributions, basic reachability and safety problems are known to be computationally intractable (i.e., Skolem-hard) to solve in such models. Further, we show that even for simple examples of MDPs, strategies for safety objectives over distributions can require infinite memory and randomization.In light of this, we present a novel overapproximation approach to synthesize strategies in an MDP, such that a safety objective over the distributions is met. More precisely, we develop a new framework for template-based synthesis of certificates as affine distributional and inductive invariants for safety objectives in MDPs. We provide two algorithms within this framework. One can only synthesize memoryless strategies, but has relative completeness guarantees, while the other can synthesize general strategies. The runtime complexity of both algorithms is in PSPACE. We implement these algorithms and show that they can solve several non-trivial examples.
APA, Harvard, Vancouver, ISO, and other styles
10

Chen, Xiaohong, Zhengyao Lin, Minh-Thai Trinh, and Grigore Roşu. "Towards a Trustworthy Semantics-Based Language Framework via Proof Generation." In Computer Aided Verification. Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-81688-9_23.

Full text
Abstract:
AbstractWe pursue the vision of an ideal language framework, where programming language designers only need to define the formal syntax and semantics of their languages, and all language tools are automatically generated by the framework. Due to the complexity of such a language framework, it is a big challenge to ensure its trustworthiness and to establish the correctness of the autogenerated language tools. In this paper, we propose an innovative approach based on proof generation. The key idea is to generate proof objects as correctness certificates for each individual task that the language tools conduct, on a case-by-case basis, and use a trustworthy proof checker to check the proof objects. This way, we avoid formally verifying the entire framework, which is practically impossible, and thus can make the language framework both practical and trustworthy. As a first step, we formalize program execution as mathematical proofs and generate their complete proof objects. The experimental result shows that the performance of our proof object generation and proof checking is very promising.
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Certificate complexity"

1

Wirz, Victor Hugo, and Pedro Nuno Moura. "An Introduction to the Complexity Class of Pure Nash Equilibrium." In Encontro de Teoria da Computação. Sociedade Brasileira de Computação - SBC, 2023. http://dx.doi.org/10.5753/etc.2023.229527.

Full text
Abstract:
Taxonomy of problems in Computer Science has been typically done with formulations as decision problems. This approach is inadequate for many search problems of interest when the structure of the instance in itself guarantees the existence of a positive certificate. In this paper, we provide an introduction to the class of problems PLS and its connections with finding Pure Nash Equilibrium in Congestion Games.
APA, Harvard, Vancouver, ISO, and other styles
2

Ammon, Sabine, Alexandra Kljagin, Juliane Rettschlag, and Martina Vortel. "The Berlin ethics certificate: conceptualizing interdisciplinarity as a core building block of ethics in engineering education." In SEFI 50th Annual conference of The European Society for Engineering Education. Universitat Politècnica de Catalunya, 2022. http://dx.doi.org/10.5821/conference-9788412322262.1422.

Full text
Abstract:
To address the need for more responsible research and innovation, there is a growing call to integrate ethics education across the science and engineering curriculum. Accordingly, ethics education must not be limited to the avoidance of scientific misconduct but rather be oriented toward addressing the complexity of planetary challenges and realizing social good. Designing curricula to accommodate the ambition of integrated ethics, however, remains a great institutional and epistemic challenge. In this paper, we introduce the Berlin Ethics Certificate (BEC) at the Technical University of Berli
APA, Harvard, Vancouver, ISO, and other styles
3

Higley, James B., David A. McLees, and Mohammad A. Zahraee. "A Case Study in Laboratory-Based Online Courses: Teaching CNC Programming." In ASME 2003 International Mechanical Engineering Congress and Exposition. ASMEDC, 2003. http://dx.doi.org/10.1115/imece2003-42204.

Full text
Abstract:
Asynchronous web based instruction, more commonly known as online education or distance learning, has been available for some time. This technology has brought education within the reach of many who would otherwise be unable to attend live classes. Time schedules and distance no longer have a bearing on attending a course. Even group projects are manageable with email and discussion groups. Many courses convert quite well to the online format, and studies have shown that students can learn as much from online courses as from live courses. In many cases, multiple course certificate programs and
APA, Harvard, Vancouver, ISO, and other styles
4

Liebenberg, Marais, Claudia C. Magalha˜es, and David Eduardo G. P. Bueno. "On the Design of an Operator Training Simulator in a South African Pipeline Network." In 2008 7th International Pipeline Conference. ASMEDC, 2008. http://dx.doi.org/10.1115/ipc2008-64527.

Full text
Abstract:
Pipeline operating companies require skilled employees to operate their pipeline network with safety and meeting the customer’s nominations, seeking to reduce costs and preserve the environment. A useful pipeline operational functionality designed to train, qualify and certificate operators to perform those tasks successfully is the Operator Training Simulator (OTS). OTS reproduces operational scenarios without the necessity of being inside the control room, allowing the trainee to simulate daily operational routines such as pumps startup/shutdown, valves opening/closing, slack line prevention
APA, Harvard, Vancouver, ISO, and other styles
5

Nita, Stefania loredana, and Marius iulian Mihailescu. "PROPOSING A SECURE FRAMEWORK FOR ELEARNING PLATFORMS USING ATTRIBUTE BASED ENCRYPTION." In eLSE 2017. Carol I National Defence University Publishing House, 2017. http://dx.doi.org/10.12753/2066-026x-17-102.

Full text
Abstract:
Nowadays, technology grows fast and cloud computing and big data become important parts of the businesses. Cloud computing brings many advantages, such as flexibility, easy recovery, automatic software updates, availability – which allows users to work from everywhere. One of the most important characteristic is that cloud computing provides resources on demand, all we need is an internet connection. So, cloud computing is adopted by more and more companies due its benefits. An important aspect of the society is education. As the technology is expanding continuously, also the education needs t
APA, Harvard, Vancouver, ISO, and other styles
6

Lyon, Tim S., and Lucía Gómez Álvarez. "Automating Reasoning with Standpoint Logic via Nested Sequents." In 19th International Conference on Principles of Knowledge Representation and Reasoning {KR-2022}. International Joint Conferences on Artificial Intelligence Organization, 2022. http://dx.doi.org/10.24963/kr.2022/26.

Full text
Abstract:
Standpoint logic is a recently proposed formalism in the context of knowledge integration, which advocates a multi-perspective approach permitting reasoning with a selection of diverse and possibly conflicting standpoints rather than forcing their unification. In this paper, we introduce nested sequent calculi for propositional standpoint logics---proof systems that manipulate trees whose nodes are multisets of formulae---and show how to automate standpoint reasoning by means of non-deterministic proof-search algorithms. To obtain worst-case complexity-optimal proof-search, we introduce a nove
APA, Harvard, Vancouver, ISO, and other styles
7

Zhang, Haitao, and Ke Li. "Predicting the Risk of Twist-Off for Rotary Shouldered Threaded Connections With a Statistical Approach." In ASME 2019 International Mechanical Engineering Congress and Exposition. American Society of Mechanical Engineers, 2019. http://dx.doi.org/10.1115/imece2019-11061.

Full text
Abstract:
Abstract Fatigue is one of the most frequently encountered failure modes of rotary shouldered connections (RSC) used in drill strings. Once initiated, a fatigue crack tends to grow and ultimately lead to a twist-off, which is catastrophic and often results in lengthy non-producing time and expensive fishing operations. The complexity of the fatigue mechanism, the variabilities of material properties, and the nonlinear contact interactions of the pin and the box elements of an RSC pose a substantial challenge to accurately predicting the fatigue life of the RSC. This would require considerable
APA, Harvard, Vancouver, ISO, and other styles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography