The following pages link to V. Vinay (Q703072):
Displaying 22 items.
- Clustering large graphs via the singular value decomposition (Q703073) (← links)
- String matching in \(\tilde O(\sqrt n+\sqrt m)\) quantum time (Q876699) (← links)
- Non-commutative arithmetic circuits: depth reduction and size lower bounds (Q1274913) (← links)
- The combinatorial approach yields an NC algorithm for computing Pfaffians (Q1887034) (← links)
- Branching rules for satisfiability (Q1904401) (← links)
- A circuit-based proof of Toda's theorem (Q2366565) (← links)
- Circuits on cylinders (Q2506165) (← links)
- (Q3359753) (← links)
- (Q4246716) (← links)
- (Q4252300) (← links)
- (Q4259990) (← links)
- (Q4352218) (← links)
- (Q4470491) (← links)
- (Q4470524) (← links)
- Determinant: Old Algorithms, New Insights (Q4699172) (← links)
- (Q4886065) (← links)
- (Q4938661) (← links)
- Determinant: Old algorithms, new insights (Q5054863) (← links)
- (Q5192682) (← links)
- (Q5501853) (← links)
- Fundamentals of Computation Theory (Q5900795) (← links)
- Logspace verifiers, NC, and NP (Q6487945) (← links)
