« first day (2636 days earlier)
← previous day
next day →
last day (993 days later) »
vzn
6:31 PM
@ABD an interesting subfield now. nearly at least a decade old, maybe more. see eg
Optimization hardness as transient chaos in an analog approach to constraint satisfaction
/ nature 2011
it also seems to be similar to
memcomputing
, search transcript or see eg
Jul 21 '15 at 22:55
, by
vzn
Memcomputing NP-complete problems in polynomial time using polynomial resources and collective states
/ Science mag
Dec 21 '15 at 10:15
, by
Thomas Klimpel
Polynomial-time solution of prime factorization and NP-hard problems with digital memcomputing machines
Oct 28 '17 at 17:23
, by
Thomas Klimpel
[1704.06145v2] A Survey and Discussion of Memcomputing Machines -arXiv
by
Daniel Saunders
« first day (2636 days earlier)
← previous day
next day →
last day (993 days later) »
all rooms
Transcript for
Sep
15
Sep '20
16
Sep
17
theory salon
theoretical computer science. highlight reel
vzn1.wordpress.co...
join this room
about this room
00:00
06:00
12:00
18:00
all times are UTC
site design / logo © 2024 Stack Exchange Inc;
legal
mobile
theory salon
theory salon