Author: ignougroup

Problem Detail: What’s the complexity of Conflict-Driven Clause Learning SAT solvers, compared to DPLL solvers? Was it proven that CDCL is faster in general? Are there instances of SAT that are hard for CDCL but easy for DPLL? Asked By : asd Read More …

Problem Detail:  l is a matrix of size [1…n, 1…n] function: rec(i,j) if (i*j == 0) return 1 else if (l[i,j] == 0) l[i,j] = 1 * rec(i-1,j) + 2 * rec(i,j-1) + 3 * rec(i-1,j-1) return l[i,j] end_function for Read More …

Problem Detail: I wanted to ask if someone can help me to construct a regular expression over the alphabet ${a,b,x}$ for the language $L$ which is constituted by all strings containing an odd number of $a$’s, and in which between each Read More …

Problem Detail: I wonder how I can go about proving that if a language L is decidable in o(nlog(n)) then L must be regular. I should probably mention that by “decidable” I mean “being decidable by single-tape deterministic turing machine”. Thanks Read More …

Problem Detail: I am trying to solve the question 6.12 in Arora-Barak (Computational Complexity: A modern approach). The question asks you to show that the $mathsf{PATH}$ problem (decide whether a graph $G$ has a path from a given node $s$ to Read More …

Problem Detail: From TAoCP, Vol. 3 by Knuth we know that expected (mean) probe counts for hash tables with open adressing and double hashing collision-resolution are: $1 over 1 – alpha$ – for unsuccessful search ${1 over alpha} ln({1 over 1 Read More …

Problem Detail: When trying to decide on the choice of a programming language for a specific task, people will often tell me: “use this language because it has the best library for the type of problems you are addressing”. I would Read More …

Problem Detail: I am studying graph currently. I found a question, which asks for The List A[] which shows shortest distances between $V$ and every other vertex The List B[] which shows shortest paths between $V$ and every other vertex as Read More …

Problem Detail: Are there any existing efficient algorithms for lazily computing a random permutation of the positive integers in a given range (e.g. the range offered by an unsigned integer type in a CPU)? What I mean is this: An algorithm Read More …