0 citations0 referencesGoogle Scholardoi.orgClassical complexity and quantum entanglementJournal of Computer and System Sciences·2004·Vol. 69(3), pp. 448–484Citations Over TimeTop 10% of 2004 papersLeonid GurvitsRelated Papers→ Testing Orientability for Matroids is NP-Complete(1999)12 cited→ MATROID COMPLEXES–GEOMETRICAL REPRESENTATIONS OF MATROIDS(1985)1 cited→ Generalized Splitting and element splitting operations on $p$-matroids(2023)1 cited→ Matroids: Further Theory(1979)→ Matroids: Further Theory(1997)