Geometric complexity theory I: an approach to the P vs. NP and related problems

Ketan D. Mulmuley and Milind Sohoni

misc2001

Citation key: MulmuleySohoni2001GCT
Year: 2001
Cited by: 1 catalog records
Direct source: Available

Reference note

Why this source is in the ledger

Ketan D. Mulmuley and Milind Sohoni, “Geometric complexity theory I: an approach to the P vs. NP and related problems,” SIAM Journal on Computing 31 (2001), 496–526, DOI: 10.1137/S009753970038715X.

Catalog connections

Conjectures citing this source

TCS-007Valiant's $VP$ versus $VNP$ ConjectureTheoretical computer science

Source record

Bibliographic fields

Inspect the parsed BibTeX fields

author: Ketan D. Mulmuley and Milind Sohoni
doi: 10.1137/S009753970038715X
note: Ketan D. Mulmuley and Milind Sohoni, “Geometric complexity theory I: an approach to the P vs. NP and related problems,” SIAM Journal on Computing 31 (2001), 496--526, DOI: 10.1137/S009753970038715X.
title: Geometric complexity theory I: an approach to the P vs. NP and related problems
year: 2001