Long Term Memory and the Densest K-Subgraph Problem (Q4993327): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claims
Set OpenAlex properties.
 
(3 intermediate revisions by 3 users not shown)
label / enlabel / en
 
Long Term Memory and the Densest K-Subgraph Problem
Property / author
 
Property / author: Wolfgang Maass / rank
 
Normal rank
Property / author
 
Property / author: Christos H. Papadimitriou / rank
 
Normal rank
Property / author
 
Property / author: Santosh Vempala / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4398864 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The dense \(k\)-subgraph problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A neuroidal architecture for cognitive computation / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.4230/LIPIcs.ITCS.2018.57 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2784141370 / rank
 
Normal rank
Property / title
 
Long Term Memory and the Densest K-Subgraph Problem (English)
Property / title: Long Term Memory and the Densest K-Subgraph Problem (English) / rank
 
Normal rank

Latest revision as of 08:43, 30 July 2024

scientific article; zbMATH DE number 7359394
Language Label Description Also known as
English
Long Term Memory and the Densest K-Subgraph Problem
scientific article; zbMATH DE number 7359394

    Statements

    0 references
    0 references
    0 references
    15 June 2021
    0 references
    brain computation
    0 references
    long-term memory
    0 references
    assemblies
    0 references
    association
    0 references
    Long Term Memory and the Densest K-Subgraph Problem (English)
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references