Category: Uncategorized

Problem Detail: I am reading Subgraph isomorphism problem I am having trouble understanding how they prove that the subgraph isomorphism problem is NP-Complete using the Hamiltonian cycles problem in the article. Can someone help me explain what is happening in more Read More …

Problem Detail: What is it about the structure of counting sort that only makes it work on integers? Surely strings can be counted? ”’ allocate an array Count[0..k] ; initialize each array cell to zero ; THEN ”’ for each input Read More …

Problem Detail: Consider an ordinary binary min-heap data structure with n elements supporting the instructions INSERT and EXTRACT-MIN in O($lg n)$ worst-case time. Give a potential function $Phi$ such that the amortized cost of INSERT is $O(lg n)$ and the amortized Read More …

Problem Detail: Here I read that: Haskell definitely does not have the most advanced type system (not even close if you count research languages) but out of all languages that are actually used in production Haskell is probably at the top. Read More …

Problem Detail: I am starting a personal bibliographic research on type-checking algorithms and want some tips. What are the most commonly used type-checking algorithms, strategies and general techniques? I am particularly interested in complex type-checking algorithms that were implemented in widely Read More …

Problem Detail: Given a context-free grammar, is there an algorithm to determine if the CFG will ever produce an even length string? Or is this undecidable? Asked By : ASDF Answered By : Hendrik Jan Of course there is a meta-algorithm via automata Read More …

Problem Detail: Basically I am aware of three foundations for math Set theory Type theory Category theory So in what ways are programming languages and foundations of mathematics related? EDIT The original question was “Programming languages based on foundations of math” Read More …

Problem Detail: There are many popular languages. But, computer scientists tell us that in order to understand the behaviour of programs in those languages definitely and unambiguously argue upon program behavior (e.g. prove their identity), we need to translate them into Read More …

Problem Detail: I’m struggling to understand the relationship between NP-Intermediate and NP-Complete. I know that if P != NP based on Lander’s Theorem there exists a class of languages in NP but not in P or in NP-Complete. Every problem in Read More …

Problem Detail: I am looking for concrete and simple problems that may be solved using bipartite graphs or bipartite graph properties. Any idea along with explanations are welcome. Asked By : Laurent Answered By : John Bupit Assignment Problem would be one such Read More …