Research ArticleCOMPUTER SCIENCE

Memcomputing NP-complete problems in polynomial time using polynomial resources and collective states

See allHide authors and affiliations

Science Advances  03 Jul 2015:
Vol. 1, no. 6, e1500031
DOI: 10.1126/sciadv.1500031

Article Information

vol. 1 no. 6

Online ISSN: 
History: 
  • Received for publication January 9, 2015
  • Accepted for publication May 6, 2015

Author Information

  1. Fabio Lorenzo Traversa1,2,
  2. Chiara Ramella2,
  3. Fabrizio Bonani2 and
  4. Massimiliano Di Ventra1,*
  1. 1Department of Physics, University of California, San Diego, La Jolla, CA 92093, USA.
  2. 2Department of Electronics and Telecommunications, Politecnico di Torino, 10129 Turin, Italy.
  1. *Corresponding author. E-mail: diventra{at}physics.ucsd.edu

Altmetric

Article usage

Article usage: June 2015 to June 2018

AbstractFullPdf
Jun 2015110
Jul 20151120377634016
Aug 2015873678323
Sep 201544147293
Oct 2015270215100
Nov 2015330236118
Dec 2015312412140
Jan 2016462244119
Feb 201614812674
Mar 2016199165122
Apr 201616013289
May 201616318176
Jun 201618616984
Jul 201614326660
Aug 201614817450
Sep 201619223490
Oct 201614618262
Nov 2016150163119
Dec 201613413998
Jan 201715918153
Feb 201711913561
Mar 201714214779
Apr 20178915741
May 201715814469
Jun 201714314491
Jul 2017839688
Aug 201711511959
Sep 201712114771
Oct 20179613044
Nov 201712412553
Dec 2017180371144
Jan 201814515182
Feb 2018847542
Mar 201817811958
Apr 201812011772
May 201810010282
Jun 2018775323