CompSci Weekend SuperThread (July 13, 2018) Computer Science |
- CompSci Weekend SuperThread (July 13, 2018)
- “Breakthrough” algorithm exponentially faster than any previous one | Harvard John A. Paulson School of Engineering and Applied Sciences
- Artificial Intelligence (New Entry at the Stanford Encyclopedia of Philosophy)
- Is the threat of quantum computers over exaggerated?
- Abundance of book pdfs about math, comp sci, hacking, ai, and more. Just thought I'd share it.
- Working code to find 'all' shortest paths from vertex a to b in an undirected graph using Dijkstra's algorithm
- Is Computer Science anything else besides math?
CompSci Weekend SuperThread (July 13, 2018) Posted: 12 Jul 2018 06:06 PM PDT /r/compsci strives to be the best online community for computer scientists. We moderate posts to keep things on topic. This Weekend SuperThread provides a discussion area for posts that might be off-topic normally. Anything Goes: post your questions, ideas, requests for help, musings, or whatever comes to mind as comments in this thread. Pointers
Caveats
[link] [comments] |
Posted: 12 Jul 2018 08:07 PM PDT |
Artificial Intelligence (New Entry at the Stanford Encyclopedia of Philosophy) Posted: 12 Jul 2018 04:17 PM PDT |
Is the threat of quantum computers over exaggerated? Posted: 12 Jul 2018 11:48 PM PDT Recently, it seems that one of the most common newly asked questions asked about a blockchain technology is whether it is quantum resistant? This is mostly asked by people without even the basic underlying understanding of cryptographic algorithms/encryptions, just another new term thrown around to create fear and uncertainty. As far as I know current cryptographic algos/hash etc are safe from any threats of quantum computers currently in existence and even symmetric cyphers are easy to protect against QT by just doubling the key size. So is this threat overblown or am i missing something? [link] [comments] |
Abundance of book pdfs about math, comp sci, hacking, ai, and more. Just thought I'd share it. Posted: 12 Jul 2018 10:01 PM PDT |
Posted: 13 Jul 2018 12:38 AM PDT Hello all, I need working code for finding all the shortest paths between vertices a and b for an undirected graph and I need to use the Dijkstra's algorithm. Below is the code I am using: https://gist.github.com/vcvcchaturvedi/3587fdea80e2329eef56380894e81805 I have read that we need to take into account the relax variable and make a list of lists of paths but I am unable to convert all that into code and can't seem to visualize how I can do this. Please help. In my code as you can see the 'shortest_path' function gives just one path. I cannot seem to get all the paths from this function as I do not really know how I can do it. I have searched a lot on the internet with search engines for working code for same, but unable to find any. Thanks [link] [comments] |
Is Computer Science anything else besides math? Posted: 12 Jul 2018 02:47 PM PDT Does Computer Science / Programming consist of any other type of subject besides mathematics? If so, what all are they? [link] [comments] |
You are subscribed to email updates from Computer Science: Theory and Application. To stop receiving these emails, you may unsubscribe now. | Email delivery powered by Google |
Google, 1600 Amphitheatre Parkway, Mountain View, CA 94043, United States |
No comments:
Post a Comment