Problem Detail: Consider the following algorithm for the maximum matching problem: Sort all nodes by their $deg(v)$ Take the node with minimal $deg(v)$ Take a random edge $(u,v)$ $in$ $E$ Add $(u,v)$ to $M$ Delete all edges of $u$ and $v$ Read More …
Category: Uncategorized
[Solved]: What is the type theory judgement symbol?
Problem Detail: In type theory judgements are often presented with the following syntax: My question is what is that symbol in the middle called? All the papers I’ve found seem to use an image rather than a unicode character so I Read More …
[Solved]: What complexity class would this version of generalized chess fall?
Problem Detail: By now I understand that generalized chess is harder than NP, and is EXPTIME-complete for the decision problem “Given an nxn board with a given position, can white force a win?” because the proof would require an exponential amount Read More …
[Solved]: Are all known algorithms for solving NP-complete problems constructive?
Problem Detail: Are there any known algorithms that correctly output “yes” to an NP-complete problem without implicitly generating a certificate? I understand that it is straightforward to turn a satisfiability oracle into a satisfying-assignment finder: just iterate over the variables, each Read More …
[Solved]: Organisation and Architecture of Quantum Computers
Problem Detail: What are devices and their interconnections used alongwith Quantum Processors? Are they compatible with hardware devices like Cache, RAM, Disks of current computers? Asked By : check123 Answered By : Artem Kaznatcheev What you describe as current computers is known as Read More …
[Solved]: What exactly is a clique cover problem?
Problem Detail: I am really confused about clique problem and clique cover problem. I tried googling it,but I don’t see to be able to visualise the clique cover problem. Asked By : user1675999 Answered By : William Macrae A clique is a simple Read More …
[Solved]: (Possibly Easy) Formal Language Question
Problem Detail: I am looking at a “practice test” for a Theory of Computation class. It was a test in a previous year. I am asked to prove that, given L1 and L2 are regular, the union and difference are both Read More …
[Solved]: Reductions among Undecidable Problems
Problem Detail: Im sorry if this question has some trivial answer which I am missing. Whenever I study some problem which has been proven undecidable, I observe that the proof relies on a reduction to another problem which has been proven Read More …
[Solved]: Minimizing the full adder – where did this XOR come from?
Problem Detail: When minimizing the full adder, I don’t understand why $A(bar{B}bar{C} + BC)$ reduces to $Aoverline{(Boplus{C})}.$ $(bar{B}bar{C} + BC)to (Boplus{C})$ is partially decipherable, but why is $(Boplus{C})$ inverted to $overline{(Boplus{C})}?$ Full adder simplification: $ bar{A}bar{B}C + bar{A}Bbar{C} + Abar{B}bar{C} + Read More …
[Solved]: How to scale down parallel complexity results to constantly many cores?
Problem Detail: I have had problems accepting the complexity theoretic view of “efficiently solved by parallel algorithm” which is given by the class NC: NC is the class of problems that can be solved by a parallel algorithm in time $O(log^cn)$ Read More …
