Long Term Memory and the Densest K-Subgraph Problem

DOI10.4230/LIPIcs.ITCS.2018.57zbMath1462.68041OpenAlexW2784141370MaRDI QIDQ4993327

Robert A. Legenstein, Santosh Vempala, Christos H. Papadimitriou, Wolfgang Maass

Publication date: 15 June 2021

Full work available at URL: https://doi.org/10.4230/LIPIcs.ITCS.2018.57

zbMATH Keywords

associationlong-term memoryassembliesbrain computation

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Neural biology (92C20) Randomized algorithms (68W20) Biologically inspired models of computation (DNA computing, membrane computing, etc.) (68Q07)

Related Items (3)

Learning hierarchically-structured concepts ⋮ Unnamed Item ⋮ Counting to Ten with Two Fingers: Compressed Counting with Spiking Neurons.

Cites Work

• Unnamed Item
• A neuroidal architecture for cognitive computation
• The dense \(k\)-subgraph problem

This page was built for publication: Long Term Memory and the Densest K-Subgraph Problem