scientific article; zbMATH DE number 2110413
From MaRDI portal
Publication:4822945
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Quantum computation (81P68) Proceedings of conferences of miscellaneous specific interest (00B25) Proceedings, conferences, collections, etc. pertaining to mathematical logic and foundations (03-06) Proceedings, conferences, collections, etc. pertaining to computer science (68-06) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Cited in
(13)- Efficient verification of Tunnell's criterion
- scientific article; zbMATH DE number 194741 (Why is no real title available?)
- Proving the infeasibility of Horn formulas through read-once resolution
- Recent advances in real complexity and computation. UIMP-RSME Lluís Santaló summer school, Universidad Internacional Menéndez Pelayo, Santander, Spain, July 16--20, 2012
- Diophantine cryptography over infinite groups
- Lower complexity bounds in justification logic
- Quantum key distribution with PRF(Hash, Nonce) achieves everlasting security
- Counting Subgraphs in Degenerate Graphs
- On an Almost-Universal Hash Function Family with Applications to Authentication and Secrecy Codes
- Counting Homomorphic Cycles in Degenerate Graphs
- Binary relations: Finite characterizations and computational complexity
- Rank bounds for a hierarchy of Lovász and Schrijver
- Recursion Theory and Computational Complexity
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4822945)
