Computer Science Stack Exchange
Computer Science Stack Exchange

Most Popular

more tags
1500 questions
14
votes
3 answers

Memoization without array

In Cormen et al.'s Introduction to algorithms, section 15.3 Elements of dynamic programming explains memoization as follow: A memoized recursive algorithm maintains an entry in a table for the solution to each subproblem. Each table entry initially…
Pece
  • 311
  • 1
  • 7
14
votes
1 answer

Concise example of exponential cost of ML type inference

It was brought to my attention that the cost of type inference in a functional language like OCaml can be very high. The claim is that there is a sequence of expressions such that for each expression the length of the corresponding type is…
mrrusof
  • 241
  • 2
  • 4
14
votes
3 answers

Closest pair of points between two sets, in 2D

I have two sets $S,T$ of points in the 2-dimensional plane. I want to find the closest pair of points $s,t$ such that $s \in S$, $t \in T$, and the Euclidean distance between $s,t$ is as small as possible. How efficiently can this be done? Can it…
D.W.
  • 167,959
  • 22
  • 232
  • 500
14
votes
6 answers

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 one. All the papers I found were mostly general…
mrsteve
  • 661
  • 1
  • 4
  • 10
14
votes
2 answers

Set Similarity - Calculate Jaccard index without quadratic complexity

I have a group of n sets for which I need to calculate a sort of "uniqueness" or "similarity" value. I've settled on the Jaccard index as a suitable metric. Unfortunately, the Jaccard index only operates on two sets at a time. In order to…
rinogo
  • 241
  • 2
  • 3
14
votes
1 answer

Alternatives to SVD for rank factorization

I have rank-deficient matrix $M \in \mathbb{R}^{n\times m}$ with $\text{rank}(M) = k$ and I want to find a rank factorization $M = PQ$ with $P \in \mathbb{R}^{n \times k}$ and $Q \in \mathbb{R}^{k \times m}$. A popular approach is to compute the…
Artem Kaznatcheev
  • 4,872
  • 2
  • 28
  • 57
14
votes
1 answer

What is induction-induction?

What is induction-induction? The resources I found are: the HoTT book, at the end of chapter 5.7. nLab's article a paper called Inductive-inductive definitions this blog post also mentions inductive-inductive types The first two references are too…
盛安安
  • 944
  • 5
  • 14
14
votes
2 answers

Reference request: Category theory as it applies to type systems

I keep hearing about how one must learn category theory to truly understand programming language theory. So far, I've learned a good deal of PL without ever stepping foot into the realm of categories. However, I figured it was time to take the leap…
gardenhead
  • 2,240
  • 14
  • 19
14
votes
2 answers

Intuition behind the Hadamard gate

I'm trying to teach myself about quantum computing, and I have a decent-ish understanding of linear algebra. I got through the NOT gate, which wasn't too bad, but then I got to the Hadamard gate. And I got stuck. Mainly because while I "understand"…
auden
  • 364
  • 2
  • 15
14
votes
2 answers

Proving DOUBLE-SAT is NP-complete

The well known SAT problem is defined here for reference sake. The DOUBLE-SAT problem is defined as $\qquad \mathsf{DOUBLE\text{-}SAT} = \{\langle\phi\rangle \mid \phi \text{ has at least two satisfying assignments}\}$ How do we prove it to be…
pnp
  • 763
  • 1
  • 7
  • 17
14
votes
3 answers

Problems conjectured but not proven to be easy

We have many problems, like factorization, that are strongly conjectured, but not proven, to be outside P. Are there any questions with the opposite property, namely, that they are strongly conjectured but not proven to be inside P?
Elliot Gorokhovsky
  • 923
  • 4
  • 15
14
votes
2 answers

Are all context-sensitive languages decidable?

I was going through the Wikipedia definition of context-sensitive language and I found this: Each category of languages is a proper subset of the category directly above it. Any automaton and any grammar in each category has an equivalent automaton…
bongubj
  • 603
  • 1
  • 7
  • 11
14
votes
3 answers

Can this algorithm still be considered a Binary Search algorithm?

While doing the second code kata (which asks you to implement a binary search algorithm five times, each time with a different method), I've come up with a slightly different solution which works as follows: If i have a sorted array of lenght 100…
user6245072
  • 345
  • 1
  • 3
  • 6
14
votes
1 answer

Testing whether an arbitrary proof is circular?

I was thinking about proofs and ran into an interesting observation. So proofs are equivalent to programs via the Curry-Howard Isomorphism, and circular proofs correspond to infinite recursion. But we know from the halting problem that in general…
hewasonlyacat
  • 141
  • 2
14
votes
1 answer

Why is the counting variant of a hard decision problem not automatically hard?

It is well-known that 2-SAT is in P. However, it seems quite interesting that counting the number of solutions to a given 2-SAT formula, i.e., #2-SAT is #P-hard. That is, we have an example of a problem for which decision is easy, but counting is…
Gideon
  • 487
  • 2
  • 9
1 2 3
…
99 100