The following pages link to Paulo Mateus (Q265391):
Displaying 50 items.
- Geometry and dynamics of one-norm geometric quantum discord (Q265392) (← links)
- Efficient approximation of the conditional relative entropy with applications to discriminative learning of Bayesian network classifiers (Q280459) (← links)
- Security analyses and improvement of arbitrated quantum signature with an untrusted arbitrator (Q382846) (← links)
- State succinctness of two-way finite automata with quantum and classical states (Q391188) (← links)
- Improving classical authentication over a quantum channel (Q406240) (← links)
- Exponentially more concise quantum recognition of non-RMM regular languages (Q473186) (← links)
- Semiquantum key distribution without invoking the classical party's measurement capability (Q496891) (← links)
- On the complexity of minimizing probabilistic and quantum automata (Q690502) (← links)
- Characterizations of one-way general quantum finite automata (Q764358) (← links)
- Multi-letter quantum finite automata: decidability of the equivalence and minimization of states (Q766174) (← links)
- A code-based linkable ring signature scheme (Q1616656) (← links)
- Witness hiding without extractors or simulators (Q1670769) (← links)
- Hybrid learning of Bayesian multinets for binary classification (Q1676890) (← links)
- Analyses and improvement of a broadcasting multiple blind signature scheme based on quantum GHZ entanglement (Q1679364) (← links)
- (Q1884888) (redirect page) (← links)
- Categorical foundations for randomly timed automata (Q1884891) (← links)
- Paracategories. I: Internal paracategories and saturated partial algebras (Q1884899) (← links)
- Paracategories. II: Adjunctions, fibrations and examples from probabilistic automata theory (Q1884930) (← links)
- Security of a single-state semi-quantum key distribution protocol (Q1993741) (← links)
- Quantum key distribution with quantum walks (Q1994738) (← links)
- Formal verification of Ethereum smart contracts using Isabelle/HOL (Q2037985) (← links)
- Synthesis of quantum images using phase rotation (Q2110969) (← links)
- A framework for universally composable oblivious transfer from one-round key-exchange (Q2177655) (← links)
- A traceable ring signature scheme based on coding theory (Q2302146) (← links)
- Probabilistic situation calculus (Q2349808) (← links)
- Reasoning about probabilistic sequential programs (Q2373709) (← links)
- Entangling and disentangling in Grover's search algorithm (Q2415324) (← links)
- Security problems in the quantum signature scheme with a weak arbitrator (Q2444020) (← links)
- Protocol insecurity with a finite number of sessions and a cost-sensitive guessing intruder is NP-complete (Q2453106) (← links)
- Weakly complete axiomatization of exogenous quantum propositional logic (Q2495653) (← links)
- Using low-density parity-check codes to improve the McEliece cryptosystem (Q2658068) (← links)
- Mediated semi-quantum secure direct communication (Q2687095) (← links)
- (Q2722028) (← links)
- (Q2851315) (← links)
- (Q2851801) (← links)
- A Process Algebra for Reasoning About Quantum Security (Q2864166) (← links)
- Exogenous Probabilistic Computation Tree Logic (Q2870286) (← links)
- Universality of quantum Turing machines with deterministic control (Q2987040) (← links)
- NON-DETERMINISM AND UNCERTAINTY IN THE SITUATION CALCULUS (Q3427872) (← links)
- (Q3527403) (← links)
- QUANTUM COMPUTATION TREE LOGIC — MODEL CHECKING AND COMPLETE CALCULUS (Q3534212) (← links)
- ON THE POWER OF QUANTUM TAMPER-PROOF DEVICES (Q3534215) (← links)
- (Q3560845) (← links)
- Temporalization of Probabilistic Propositional Logic (Q3605519) (← links)
- Reasoning About States of Probabilistic Sequential Programs (Q3613341) (← links)
- (Q4471713) (← links)
- (Q4499225) (← links)
- (Q4600393) (← links)
- Decision and optimization problems in the unreliable-circuit logic (Q4644487) (← links)
- Universal aspects of probabilistic automata (Q4792945) (← links)
