Computer Science Weekly Newsletter
Computer Science Weekly Newsletter

Top new questions this week:

Huffman encoding: why is there no need for a separator?

Char Code ==== ==== E 0000 i 0001 y 0010 l 0011 k 0100 . 0101 space 011 e 10 r 1100 s 1101 ...

coding-theory encoding-scheme huffman-coding  
asked by BufBills 15 votes
answered by David Richerby 44 votes

If P=NP, are there cryptosystems that would require n^2 time to break?

If P does equal NP, will it still be possible do design a cryptosystem where the optimal cryptanalysis algorithm takes, say, the square of the time taken up by the legitimate encryption and decryption ...

cryptography encryption  
asked by S.LAKSHMINARAYAN 14 votes
answered by Gilles 14 votes

Can any finite problem be in NP-Complete?

My lecturer made the statement Any finite problem cannot be NP-Complete He was talking about Sudoku's at the time saying something along the lines that for a 8x8 Sudoku there is a finite set of ...

np-complete np  
asked by Aceboy1993 10 votes
answered by Yuval Filmus 13 votes

Will $L = \{a^* b^*\}$ be classified as a regular language?

Will $L = \{a^* b^*\}$ be classified as a regular language? I am confused because I know that $L = \{a^n b^n\}$ is not regular. What difference does the kleene star make?

formal-languages regular-languages kleene-star  
asked by user6268553 7 votes
answered by Yuval Filmus 20 votes

What is the relation between First Order Logic and First Order Theory?

I thought that any FOT is a subset of FOL, but that does not seem to be the case, because FOL is complete (every formula is either valid or invalid), while some FOT (like linear integer arithmetic) is ...

logic first-order-logic  
asked by Ayrat 7 votes
answered by Yuval Filmus 11 votes

If O(log n) vs O(n) is exponential what is O(1) vs O(n)?

If one refers to using an O(log n) instead of an O(n) algorithm as an exponential speedup, how would one refer the speedup gained by using an O(1) algorithm vs an O(n)?

complexity-theory terminology  
asked by user695652 7 votes
answered by Tom van der Zanden 5 votes

Origin of the concept of types

About the state of art that I'm running ahead of Type Theory I have the these question all related between them. Where did the idea of type come from? (It seems that all start when Russell and ...

type-theory history  
asked by jonaprieto 5 votes

Greatest hits from previous weeks:

If the speed of electrical charge hasn't changed, how have computers become faster?

Everyone knows computing speed has drastically increased since their invention, and it looks set to continue. But one thing is puzzling me: if you ran an electrical current through a material today, ...

computer-architecture  
asked by leylandski 41 votes
answered by Jacen 55 votes

Are there any problems that get easier as they increase in size?

This may be a ridiculous question, but is it possible to have a problem that actually gets easier as the inputs grow in size? I doubt any practical problems are like this, but maybe we can invent a ...

algorithms asymptotics  
asked by dsaxton 53 votes
answered by D.W. 36 votes

Can you answer these?

How to efficiently create balanced KD-Trees from a static set of points

From Wikipedia, KD-Trees: Alternative algorithms for building a balanced k-d tree presort the data prior to building the tree. They then maintain the order of the presort during tree construction ...

algorithms search-algorithms trees binary-trees search-trees  
asked by Shiro 1 vote

Branch and Bound running time and golden ratio

This is a follow up question to When does Branch and Bound exactly stop giving solutions for the bin packing problem After testing many instances I found out that when r = V / Vtotal <= ϕ (Golden ...

algorithms complexity-theory optimization branch-and-bound  
asked by AIri 3 votes

In instruction pipelining, can we forward an operand more than one clock cycle?

Most operand forwarding examples that use the standard 5-stage MIPS pipeline forward operands from EX or MEM by ONE clock cyle to a later instruction. Is it possible to do so for more than one (from ...

computer-architecture cpu-pipelines  
asked by curious 2 votes
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