(Quantum) complexity of testing signed graph clusterability
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 1559556 (Why is no real title available?)
- A Smooth Entropy Approach to Quantum Hypothesis Testing and the Classical Capacity of Quantum Channels
- A brief introduction to property testing
- A fast and simple randomized parallel algorithm for the maximal independent set problem
- Algebraic property testing: the role of invariance
- Algorithmic and analysis techniques in property testing
- Asymptotically good Quantum and locally testable classical LDPC codes
- Correlation clustering
- Correlation clustering in general weighted graphs
- Efficient quantum algorithms for (gapped) group testing and junta testing
- Entanglement is necessary for optimal quantum property testing
- Estimating the distance to a monotone function
- Every monotone graph property is testable
- Locally testable codes with constant rate, distance, and locality
- On the notion of balance of a signed graph
- Property testing and its connection to learning and approximation
- Property testing. A learning theory perspective
- Quantum Property Testing
- Quantum property testing for bounded-degree graphs
- Some Applications of Coding Theory in Computational Complexity
- Testing Polynomials over General Fields
- Testing Triangle-Freeness in General Graphs
- Testing k-colorability
- Testing juntas
- Testing of Clustering
- Testing satisfiability
- Testing subgraphs in large graphs
This page was built for publication: (Quantum) complexity of testing signed graph clusterability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6859965)
