scientific article; zbMATH DE number 2110413
From MaRDI portal
Publication:4822945
zbMath1048.68008MaRDI QIDQ4822945
No author found.
Publication date: 25 October 2004
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Proceedings of conferences of miscellaneous specific interest (00B25) Quantum computation (81P68) Proceedings, conferences, collections, etc. pertaining to computer science (68-06) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Proceedings, conferences, collections, etc. pertaining to mathematical logic and foundations (03-06) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Related Items (9)
Counting Subgraphs in Degenerate Graphs ⋮ Counting Homomorphic Cycles in Degenerate Graphs ⋮ Lower complexity bounds in justification logic ⋮ Quantum key distribution with PRF(Hash, Nonce) achieves everlasting security ⋮ Binary relations: Finite characterizations and computational complexity ⋮ Rank bounds for a hierarchy of Lovász and Schrijver ⋮ On an Almost-Universal Hash Function Family with Applications to Authentication and Secrecy Codes ⋮ Efficient verification of Tunnell's criterion ⋮ Unnamed Item
This page was built for publication:
