Result 1 to 20 of 64 total
Geometric complexity theory. III: On deciding nonvanishing of a Littlewood-Richardson coefficient. (English)
J. Algebr. Comb. 36, No. 1, 103-110 (2012).
1
On P vs. NP and geometric complexity theory: dedicated to sri ramakrishna. (English)
J. ACM 58, No. 2, 5 (2011).
2
On P vs. NP, geometric complexity theory, and the Riemann hypothesis. (English)
Comput. Res. Repos. 2009, Article No. 0908.1936 (2009).
3
On P vs. NP, geometric complexity theory, explicit proofs and the complexity barrier. (English)
Comput. Res. Repos. 2009, Article No. 0908.1932 (2009).
4
Geometric complexity theory. II: Towards explicit obstructions for embeddings among class varieties. (English)
SIAM J. Comput. 38, No. 3, 1175-1206 (2008).
5
Geometric complexity theory VIII: On canonical bases for the nonstandard quantum groups. (English)
Comput. Res. Repos. 2007, Article No. 0709.0751 (2007).
6
Geometric complexity theory VII: Nonstandard quantum group for the plethysm problem. (English)
Comput. Res. Repos. 2007, Article No. 0709.0749 (2007).
7
On P vs. NP, geometric complexity theory, and the flip I: a high level view. (English)
Comput. Res. Repos. 2007, Article No. 0709.0748 (2007).
8
Geometric complexity theory: Introduction. (English)
Comput. Res. Repos. 2007, Article No. 0709.0746 (2007).
9
Geometric complexity theory VI: The flip via saturated and positive integer programming in representation theory and algebraic geometry. (English)
Comput. Res. Repos. 2007, Article No. 0704.0229 (2007).
10
Geometric complexity theory V: On deciding nonvanishing of a generalized littlewood-richardson coefficient. (English)
Comput. Res. Repos. 2007, Article No. 0704.0213 (2007).
11
Geometric complexity theory IV: Quantum group for the Kronecker problem. (English)
Comput. Res. Repos. 2007, Article No. 0703110 (2007).
12
Geometric complexity theory II: Towards explicit obstructions for embeddings among class varieties. (English)
Comput. Res. Repos. 2006, Article No. 0612134 (2006).
13
Geometric complexity III: On deciding positivity of littlewood-richardson coefficients. (English)
Comput. Res. Repos. 2005, Article No. 0501076 (2005).
14
Geometric complexity theory, P vs. NP and explicit obstructions. (English)
Musili, C. (ed.) et al., Advances in algebra and geometry. Proceedings of the international conference on algebra and geometry, Hyderabad, India, December 7‒12, 2001. New Delhi: Hindustan Book Agency (ISBN 81-85931-36-4/hbk). 239-261 (2003).
15
Geometric complexity theory. I: An approach to the P vs. NP and related problems. (English)
SIAM J. Comput. 31, No.2, 496-526 (2001).
16
A lower bound for the shortest path problem. (English)
J. Comput. Syst. Sci. 63, No.2, 253-267 (2001).
17
Randomized algorithms in computational geometry. (English)
Sack, J.-R. (ed.) et al., Handbook of computational geometry. Amsterdam: North-Holland. 703-724 (2000).
18
A lower bound for the shortest path problem (English)
IEEE Conference on Computational Complexity, 14-21 (2000).
19
Is there an algebraic proof for $\text{P} \Leftrightarrow \text{NC}$? (Extended abstract). (English)
STOC ’97. Proceedings of the 29th annual ACM symposium on theory of computing, El Paso, TX, USA, May 4-6, 1997. New York, NY: ACM, Association for Computing Machinery, 210-219 (1999).
20
Result 1 to 20 of 64 total
Start
Contact
Print
General Help
