A partially structure-preserving algorithm for the permanents of adjacency matrices of fullerenes (Q709589): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Feng-Shan Bai / rank
Normal rank
 
Property / author
 
Property / author: Feng-Shan Bai / 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/j.cpc.2004.08.003 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2128300776 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Permanents / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of computing the permanent / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating the Permanent / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Monte-Carlo Algorithm for Estimating the Permanent / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating the permanent: A simple approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial Time Algorithms to Approximate Permanents and Mixed Discriminants Within a Simply Exponential Factor / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating the number of monomer-dimer coverings of a lattice. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating the permanent via importance sampling with application to the dimer covering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Calculation of the permanent of a sparse positive matrix / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast computer algorithm for finding the permanent of adjacency matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: The permanent of 0-1 matrices and Kallman's algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3851094 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3932310 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Method for Finding Permanents of 0, 1 Matrices / rank
 
Normal rank

Latest revision as of 09:03, 3 July 2024

scientific article
Language Label Description Also known as
English
A partially structure-preserving algorithm for the permanents of adjacency matrices of fullerenes
scientific article

    Statements

    A partially structure-preserving algorithm for the permanents of adjacency matrices of fullerenes (English)
    0 references
    0 references
    0 references
    18 October 2010
    0 references
    0 references
    0 references
    0 references
    0 references
    permanent of matrix
    0 references
    adjacency matrix
    0 references
    structure-preserving algorithm
    0 references
    fullerenes
    0 references
    0 references