Problem Detail: I have been reading on converting first order logic sentences to conjunctive normal form, and then performing resolution. One of the steps of converting to CNF, is to Standardize variables: rename all variables so that each quantifier has its Read More …
Author: ignougroup
[Solved]: How do I classify my emulator input optimization problem, and with which algorithm should I approach it?
Problem Detail: Due to the nature of the question, I have to include lots of background information (because my question is: how do I narrow this down?) That said, it can be summarized (to the best of my knowledge) as: What Read More …
[Solved]: Maximum independent nodes subset algorithm with strong constraint
Problem Detail: I’ve a tree with weighed nodes, the problem is to flag a subset of nodes with the following constraints: The selected nodes must be the optimal solution (maximal sum of weight). If one node is flagged no adjacent nodes Read More …
[Solved]: How to build/recognise a deadlock-free order of resources
Problem Detail: I have been faced with a problem where three concurrent processes X, Y ,Z execute three different code segments that access and update certain shared variables. Before entering the respective code segments : Process X executes the P operation Read More …
[Solved]: Practical applications of Weighted Independent Set in path graph?
Problem Detail: Consider Weighted Independent Set in a path graph, i.e., a graph where all the vertices are in a single path. Does this problem have practical applications? What are some? This problem is used in many CS courses as an Read More …
[Solved]: Minimize Deterministic Finite Automata with no accepting states
Problem Detail: I have a finite automaton with no final/accepting states, so F is empty. How do I minimize it? I got this on a test and I didn’t know how to approach the problem because the automaton had no accepting Read More …
[Solved]: Hash table versus binary search lookup for unchanging data
Problem Detail: Let’s say I have some static, unchanging data (no adds, modifies or deletes) which is looked up by a string value, and that I’m looking to minimize size in memory while also trying to minimize lookup time. It seems Read More …
[Solved]: Software mutexes and consensus number 1
Problem Detail: There are numerous possibilities to implement a software mutex using only shared memory (e.g. Dekker’s algorithm). Recently I’ve read the following from a paper “Wait-free Synchronization” by M. Herlihy: there exists no two-process consensus protocol using multireader/multiwriter atomic registers. And Read More …
[Solved]: Language with $loglog n$ space complexity?
Problem Detail: We know that every non-regular language can be recognized with $ Omega (loglog n) $ space complexity. I’m looking for an example of a language which is $ Theta (loglog n) $ space complexity (if such exists). Asked By Read More …
[Solved]: randomized algorithm for checking the satisfiability of s-formulas, that outputs the correct answer with probability at least $frac{2}{3}$
Problem Detail: I’m trying to practice myself with random algorithms. Lets call a CNF formula over n variables s-formula if it is either unsatisable or it has at least $frac{2^n}{n^{10}}$ satisfying assignments. I would like your help with show a randomized Read More …