scientific article; zbMATH DE number 2110413
zbMATH Open1048.68008MaRDI QIDQ4822945FDOQ4822945
Author name not available (Why is that?)
Publication date: 25 October 2004
Title of this publication is not available (Why is that?)
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
- 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
- On an Almost-Universal Hash Function Family with Applications to Authentication and Secrecy Codes
- Lower complexity bounds in justification logic
- Quantum key distribution with PRF(Hash, Nonce) achieves everlasting security
- Counting Homomorphic Cycles in Degenerate Graphs
- Recursion Theory and Computational Complexity
- Title not available (Why is that?)
- Title not available (Why is that?)
- Counting Subgraphs in Degenerate Graphs
- Binary relations: Finite characterizations and computational complexity
- Rank bounds for a hierarchy of Lovász and Schrijver
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)
