The complexity of computing the permanent (Q600247): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q55885263, #quickstatements; #temporary_batch_1704767531357
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Q600246 / rank
Normal rank
 
Property / author
 
Property / author: Leslie G. Valiant / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0304-3975(79)90044-6 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2006912660 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the computational power of pushdown automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of theorem-proving procedures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4133135 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for Distinct Representatives / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5682013 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3259107 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4140381 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4142699 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization of convertible (0,1)-matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the relation between the determinant and the permanent / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3851094 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lower bound on the number of additions in monotone computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: The polynomial-time hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gaussian elimination is not optimal / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relative complexity of checking and evaluating / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Enumeration and Reliability Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Every Prime Has a Succinct Certificate / rank
 
Normal rank
Property / cites work
 
Property / cites work: A method for obtaining digital signatures and public-key cryptosystems / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 03:09, 13 June 2024

scientific article
Language Label Description Also known as
English
The complexity of computing the permanent
scientific article

    Statements

    The complexity of computing the permanent (English)
    0 references
    1979
    0 references
    0 references
    computational complexity
    0 references
    permanent of a matrix
    0 references
    determinant
    0 references
    0 references
    0 references
    0 references