Computer Science Weekly Newsletter

Computer Science newsletter

Top new questions this week:

Why is the object destructor paradigm in dynamic languages pervasively absent?

Looking for insight into decisions around dynamic language design. Perhaps a language expert could enlighten me? I come from a C++ background, so this area is baffling to me. It seems nearly all ...

programming-languages language-design  
asked by dbcb 7 votes
answered by kdbanman 1 vote

Efficient algorithm to compute the $n$th Fibonacci number

The $n$th Fibonacci number can be computed in linear time using the following recurrence: def fib(n): i, j = 1, 1 for k in {1...n-1}: i, j = j, i+j return i The $n$th Fibonacci ...

algorithms time-complexity recurrence-relation  
asked by augurar 5 votes
answered by Yuval Filmus 7 votes

Travelling with the most efficient path

A friend of mine actually asked me a very interesting computer science related question, and I have been stuck on it for a long time. The problem is: you have to travel $1000$ km. The only gas ...

algorithms complexity-theory efficiency greedy-algorithms  
asked by HenryHey 5 votes

What happens to multi-qubit quantum state after one of qubits is measured?

If we have a quantum state consisting of (let's say) 3 entangled qubits and we read the value of one of them, what happens to the probabilities of the remaining possible states? For example, if we ...

quantum-computing  
asked by Byakuya 5 votes
answered by Yuval Filmus 6 votes

Fastest known complexity for combinatorial ILP algorithm?

I'm wondering, what is the best known algorithm, in terms of Big-$O$ notation, to solve Integer Linear Programming? I know that the problem is $NP$-complete, so I'm not expecting anything polynomial. ...

algorithms complexity-theory reference-request np-complete integer-programming  
asked by jmite 4 votes

What's the meaning of the name P/poly?

I understand the normal definitions of the P/poly class, but I'm curious how the name came about. The syntax of the name looks like a quotient group, but I can't think of any way to define P/poly ...

terminology complexity-classes  
asked by Akroy 4 votes
answered by Luke Mathieson 5 votes

What are the advantages of cuckoo hashing over dynamic perfect hashing?

Dynamic perfect hash tables and cuckoo hash tables are two different data structures that support worst-case O(1) lookups and expected O(1)-time insertions and deletions. Both require O(n) auxiliary ...

data-structures hash-tables  
asked by templatetypedef 4 votes
answered by jbapple 0 votes

Greatest hits from previous weeks:

Definition of the state of an object in OOP

I need a concise definition of the "state of an object" in object-oriented programming (for a paper). For about half of a day I searched for a paper that I can cite on this topic, but I couldn't find ...

terminology reference-request programming-languages object-oriented  
asked by mrsteve 3 votes
answered by Vor 5 votes

Why hex, octal or hexadecimal? Computers use binary and humans decimals

Why do we use other bases which are neither binary (for computers) nor decimals (for humans)? Computers end up representing them in binary, and humans strongly prefer getting their decimal ...

numeral-representations  
asked by Quora Feans 3 votes
answered by dtech 9 votes

Can you answer these?

How are basic feasible solutions in linear programming related to vertices in its corresponding polytope?

In Section 2.3.3 "Polytopes and LP" of the book "Combinatorial Optimization: Algorithms and Complexity" by Christos H. Papadimitriou, Theorem 2.4 establishes the relation between bfs's (basic feasible ...

algorithms linear-programming  
asked by hengxin 2 votes

Mutations as a crossover byproduct

Let's say I'm writing a GA to find an optimal path to travel from point A to point B. Genotypes are a list of directions (North, South, East, West) to follow. So a genotype "NENWEE" will move North ...

genetic-algorithms  
asked by Philippe Olivier 1 vote

Examples of real world graphs that are too big for a single commodity-type machine

I've been reading on distributed systems for processing on large graphs. The most prominent examples include Pregel (developed by Google) and Apache Giraph. Most of these systems argue their existence ...

distributed-systems space-complexity big-data  
asked by bigdataguy 1 vote
Subscribe to more Stack Exchange newsletters


Unsubscribe from this newsletter or change your email preferences by visiting your subscriptions page on stackexchange.com.

Questions? Comments? Let us know on our feedback site. If you no longer want to receive mail from Stack Exchange, unsubscribe from all stackexchange.com emails.

Stack Exchange, Inc. 110 William St, 28th Floor, NY NY 10038 <3