Random Graphs In A Neural Computation Model (Q4464413): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Alexandros V. Gerbessiotis / rank
Normal rank
 
Property / author
 
Property / author: Alexandros V. Gerbessiotis / 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.1080/0020716031000079518 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1977967757 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The longest path in a random graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast probabilistic algorithms for Hamiltonian circuits and matchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3825928 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5624436 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A graph-theoretic result for a model of neural computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A theory of the learnable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4858551 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 17:32, 6 June 2024

scientific article; zbMATH DE number 2067836
Language Label Description Also known as
English
Random Graphs In A Neural Computation Model
scientific article; zbMATH DE number 2067836

    Statements