instruction stringlengths 35 29.1k |
|---|
Modify Turing’s proof of the undecidability of the halting problem to show there is no Turing machine P with the following two properties:
For all Turing machines M, if M() accepts then P(⟨M⟩) accepts, while if M() rejects
then P(⟨M⟩) rejects.
P(x) halts for every input x. (In other words, if M() runs forever, then P(... |
I am familiar with the polish notation when it comes to algorithmically reading phrases, but I am having a hard time proving the following exercise:
K is a function so that 1) $K(*)$ is an integer if $*$ is a symbol of a language, 2) if $\sigma = \sigma_1 \sigma_2 \dots \sigma_n$ is a phrase of the language, then $K(\... |
To prove this, Introduction to Algorithms by Cormen et al., makes the assumption that the node has two children.
For the inductive step, consider a node $x$ that has positive height and is an internal node with two children. Each child has a black-height of either $bh(x)$ or $bh(x) - 1$, depending on whether its color... |
I'm trying to calculate the main memory size, and the only information given is the size of the cache, which is 256 KB, and the number of tag bits, which is 8. Cache is a 4-way set associative memory.
I'm wondering why block size information is missing in this question, because without it, I'm not able to calculate the... |
Let the universe be the set $U$ and a set of subsets $S$ be such that $\cup_{s \in S} s = U$. I am interested in computing the longest sequence of sets $s_1, ..., s_k$ such that:
$s_i \in S$ $\forall i \in [k]$
$s_i \not\subseteq \cup_{j=1}^{i-1} s_j$ (so each $s_i$ adds at least one new element on top of the existin... |
My Professor for my Computer Organization class gave us a few questions about caches on an assignment. I'm completely stumped by most of them. I've watched a few videos on caches on YouTube by Intermation, read the textbook, and even asked my friend (the Professor's office hours are not today). The textbook our Profess... |
Link: https://dl.acm.org/doi/pdf/10.1145/3149.214121
In the proof for Lemma 2, the authors define two initial states to be adjacent if the only difference between them is the value in the input register $x_p$ for a single process $p$. Then, they claim that any two initial configurations can be joined by a chain of init... |
How do you believe prominent deep learning ASIC makers such as Nvidia and Google will alter their hardware design over the next decade to meet the exponentially expanding need for extra computing to train and execute machine learning models?
For example, since the beginning of the current machine learning boom, the ind... |
The options are:
(a) $L \cap a^{\ast}b^{\ast}$
(b) $(L \cap a^{\ast}b^{\ast}) \cup a^{\ast}b^{\ast}$
(c) $L \cup a^{\ast}b^{\ast}$
(d) $(L \cap a^{\ast}b^{\ast}) \cup b^{\ast}a^{\ast}$
My doubt is: We don't know what exactly $L$ is, it could be $a^{n}b^{n}$ or $b^{n}a^{n}$, we for sure know that $L$ is either of the tw... |
Basically what i am trying to prove is this :
$f(n),g(n) \neq 0\quad , n>0 \ \ \ \ and f(n)=Ω(g(n)) \ \ \ , \ then \frac{1}{f(n)}=O(\frac{1}{g(n)}) $
I guess that if we take the definition of $f(n) = Ω (g(n))$ , which means that $f(n) \ge cg(n) $ for every $ n \ge n0$ and then flip the relation so that it becomes $... |
I have a matrix (input):
--
c1
c2
c3
r1
AA
BB
CC
r2
CC
RR
BB
r3
EE
DD
FF
r4
KK
DD
EE
r5
DD
GG
KK
r6
PP
QQ
KK
Let's call each matrix cell a namespace. If two rows begin from the same namespace, then such a namespace is called a reused namespace. A reused namespace does not need to be a prefix. In ... |
I have encountered at my work currently a problem where I want to find an efficient algorithm for, although I suspect this might be hard problem. Maybe you can help me to tell if this is a NP hard problem or hint me to an algorithm.
When looking for similar problems, I found the hitting set problem. But my problem is a... |
Suppose that there is a set of strings such that for each n there is at most one string |w| = n. For any given n there is a 50:50 chance that such a string exists. These string can be arranged in a lookup table such that the binary value of the string is interpreted as an index, the table entry indicates yes/no i.e. th... |
On page 103 of Mike Sisper's Introdution to Theory of Computation, it says that the grammar has 27 terminals (26 being the letters of the English Alphabet and 1 being the space character) but in the rules above, I don't see those 27 terminals. I only see 10 which are "a", "the", "boy", "girl", "flower", "touches", "lik... |
in the step where you have to remove the epsilons, would you need to remove something like this:
A -> Bε
Or would you simply remove the ones that have epsilon by itself like this:
A -> ε
|
I am writing this CFG to solve the problem:
$S \to ASBSC$
$A \to aAe ~|~ ε$
$B \to aBd ~|~ ε$
$C \to bcC ~|~ ε$
Is this correct or not?
|
I've recently learnt the execution of MIPS instruction set using single cycle processor. However I'm not getting one thing. Since one clock cycle is needed for the complete instruction we only have one positive clock edge. When the clock is made high on the first time in this rising PC value is written but we may have ... |
The operation of shuffle takes two words and merges their symbols, keeping the symbols of each of the strings in the right order. It can be recursively defined by $x \parallel \varepsilon = \varepsilon \parallel x = x$ and $ax \parallel by = a (x \parallel by) \cup b (ax \parallel y)$. Here $a,b\in \Sigma$ and $x,y\in ... |
Why is it that a Turing machine can perform all kinds of calculations and procedures?
As a test, I tried to perform a four-quadratic calculation using a Turing machine myself.
However, although I found that it can perform the four arithmetic operations as a result, I do not understand the principle of why it can do so.... |
given this information of a language I need to determine if the language is regular or not:
I thought to Assume by way of contradiction that L6 satisfies the conditions of the pumping lemma. Let p be the pumping constant. Consider the word w = 0^(P-1)1...
Clearly w ∈ L6. Thus, by the pumping lemma, there exist x, y, z... |
In my algorithms class, my professor presented the problem of finding the largest sum of non-adjacent elements in an array. For example, if we have $[1,4,3,8,5]$ the largest sum of non-adjacent elements is $4 + 8 = 12$. My professor said we can solve this problem via dynamic programming since it exhibits optimal substr... |
The sequences are made up of only digits. A displacement is defined as pair $(i, j)$ such that $i > j$ and $A[i] < A[j]$. For example, 423 has 2 displacements.
The question is to find the number of sequences of length $N$ such that number of displacements is less than a given $k$ in $O(n^2)$.
The only given hint is tha... |
Suppose I have $n$ i.i.d. copies of some channel $W_{Y|X}$ for some finite $n$. I wish to send the maximum number of messages over these $n$ copies such that the error in decoding the message is at most $\varepsilon$. There is some encoder and decoder that I use. Let such an encoder result in some input distribution $p... |
You are all familiar with the halting problem so I won't repeat it.
Suppose $H$ is a Turing machine which takes as input an encoding of another Turing machine $M$, then searches all possible proof strings until it finds a proof that $M$ halts or a proof that $M$ does not halt. Of course, if there is no such proof then ... |
NP has several complete problems, which reduce to one another. In this sense, they are all "equal" in terms of hardness.
There are other problems in NP that are also "equal" to one another; for example, all the languages containing only a single string are equal. All of these are in P as they are finite.
Let's define a... |
the question is as follows:
"Generalize MATRIX-MULTIPLY-RECURSIVE to multiply n × n matrices for which n is not necessarily an exact power of 2. Give a recurrence describing its running time. Argue that it runs in Θ(n^3) time in the worst case."
how do you go about solving this?
my solution to the first part of the que... |
Before I introduce my problem I need to define a couple of things. Suppose we have two sets $S_1=\{1,2,3\}$ and $S_2=\{2,3,4\}$. A compression tree for $S_1$ and $S_2$ is
{2,3}
/ \
/ \
{1} {4}
i.e. the left leaf is associated with $S_1$ and has the property that the union of the sets in a leaf-to-root p... |
The following is a dublicate of the question presented here:
Let $G$ and $H$ be simple graphs. We build the graph $G\times H$ such that every vertex $(u,v) \in V(G\times H)$ is an ordered pair of one vertex from G(the first) and another from H(the latter). Additionally, two vertices $(u_1,v_1),(u_2,v_2)$ are connected... |
Say there are 5 candidates, A, B, C, D, and E. An election is held using a ranked voting method. That is to say, each voter submits a preference list (the order in which they prefer candidates). E.g. A > B > C > D > E could be my preference list.
For most election schemes, a voter is allowed exclude candidates from the... |
Is the clique decision problem in co-NP?
Definitions:
"In the clique decision problem, the input is an undirected graph and a number k, and the output is a Boolean value: true if the graph contains a k-clique, and false otherwise." (https://en.wikipedia.org/wiki/Clique_problem)
"A decision problem is in co-NP precisely... |
Let's say that we have a decision problem $P$. Let's also say that $I_n$ is the set of all instances of size $n$ that exist for this problem, and that its cardinality is finite.
There is a sequence of bits that uniquely represents each instance (of that size) of the problem. Each of these sequences has $b(n)$ bits (for... |
Assume that I have a bunch of bitsets (strings on $\{0,1\}$) of the same length, e.g.:
101110001
001001101
010101010
101001001
101010101
I want to find the largest set of bits (indices, not necessarily consecutive) that takes all possible values in these bitsets. In the example above:
101|11|0001
001|00|1101
010|10|10... |
I don't really understand why promise problems are classified differently than decision problems.
Consider this problem as an example. Given some real number between $0$ and $1$, determine if it greater than $\frac{1}{2}$ or not.
In this problem, that the real number is between $0$ and $1$. Let's say our alphabet is $\... |
In the Louvain algorithm, a super node is created in the second phase with self-loops from the sum of intra-community edges. According to the original paper and the lecture CS224W, self-loop edges are counted with a factor of 1, while edges between different nodes of the same community are counted with a factor of 2, a... |
Consider small instance of GAP involving 5 items and 2 resources with capacities 5 and 12 respectively. If we have cost matrix Cij and also consumption matrix bij with jobs vs resources, how can we calculate the objective function value using modified greedy heuristic algorithm when we have dual multiplier values alpha... |
I want to know the minimum number of elements needed to create a tree with the longest path having n edges. How can I approach this problem using the forest implementation of disjoint sets with union by rank and path compression? Would it just be n+1 elements? Or am I missing something? I feel as though n+1 would be to... |
Given two types, T1 and T2, how does structural equivalence work when they're self-referential? Further, how do we go about proving it?
T1: struct { a: int, b: pointer to T2 }
T2: struct { a: int, b: pointer to T1 }
I was attempting to create a directed graph, and by proving the directed graphs are equivalent, we can ... |
I'm trying to prepare for mock exam, could you please help me with possible solutions?
Design and analyze an efficient algorithm that, given n distinct integers, returns
an element which is neither the smallest nor the largest
|
I am conducting a stateful search of a large graph in an effort to find some solutions of minimal cost. With an admissible heuristic for estimated time to completion from a given state (as in A*), I would be able to drop states out of the search queue to improve runtime, otherwise I need a good heuristic that can advan... |
What's the proper way to declare an object in pseudocode.
For example:
const car = {type:"Fiat", model:"500", color:"white"};
Would it be correct to write
object car {
type: "Fiat"
model: "500"
color: "white"
}
Or should a different format be used?
Thanks in advance.
|
A walk is a finite or infinite sequence of edges which joins a sequence of vertices. A trail is a walk in which all edges are distinct.
A cycle in a graph is a non-empty trail in which only the first and last vertices are equal.
We know that determining whether two vertices (or two edges) fall on a triangle is relative... |
I'm working on problem 19.4-1 from the CLRS book, which asks to show that the height of an n-node Fibonacci heap can be greater than O(lg n) by exhibiting a sequence of operations that creates a Fibonacci heap consisting of just one tree that is a linear chain of n nodes.
I'm not sure if by "linear chain" the problem m... |
I have some troubles in understanding of the Brzozowski's algorithm for NFA to minimized DFA transformation. Or maybe I'm doing a mistake in the NFA to DFA transformation steps.
The Algorithm, as described in Wikipedia, is as follows:
Reverse the NFA.
Transform to DFA.
Reverse DFA.
Transform to DFA again.
Let's assum... |
I have been asked to describe through an FSA a system where some inputs do not determine any state transitions, but that provide outputs. There is no self-transition, and the input is not rejected: the state literally does not change, while an output is produced. I started with NFSAs, but it does not seem to suit the r... |
If P = NP, then is it the case that there exists a total recursive function from the set of polynomial-time nondeterministic Turing machines to the set of polynomial-time deterministic Turing machines such that it sends every nondeterministic machine to an equivalent deterministic machine?
|
My question is pretty much just the title.
It is pretty easy to see that any finite language can be solved in $O(1)$ time. For this reason, every finite languages is in $P$, $L$, and $DTIME(O(1))$.
But are finite languages the only languages that can be decided in constant time?
|
I am studying the complexity of SAT resolution refutation. There is a useful tool named weakening rule
The weakening rule:
B -->B ∨ C
says that from a clause B we can derive the weaker clause B ∨ C for an arbitrary C. We say
that B ∨ C is a weakening of B.
We can add this extra rule without loss of generality, since a... |
One big problem in complexity theory is $P$ vs $L$. I was just thinking about why this isn't trivial, and I came up with the following example. Of course, it cannot work as a proof as it seems too easy. So what is wrong in the below "proof?"
Let $\Sigma = \{0, 1\}$. $L \subset \Sigma^*$ where
$$
l \in L \iff \text{the ... |
The usual many-one reduction involves Turing machines transforming an input, $w$, of some language to an input, $f(w)$, of some other language in polynomial time. (Where $w \in L_1 \iff f(w) \in L_2$).
But for $P$-completeness, logspace or NC reductions are often used instead (taken from wikipedia), as using polynomial... |
What component and mechanism determines which DMA transfer mode is used?
How can be identified what DMA mode is used by a device, let's say on Linux?
Let's consider a contemporary AMD or Intel x86-64 system with two DMA PCIe devices.
Device 1 is an input device that regularly DMA writes for 300 microseconds (I'm guessi... |
In this question I need your help researching time complexity of a dynamic array with insert-last(x) and delete-last() operations:
We define a data structure and call it dynamic array, we define the operations inseet-last(x) and delete-last(), we also define a set of rules for this data structure:
Insert-last(x): inser... |
I often hear NP-completeness as problems such that, if they were in $P$ all problems in $NP$ are in $P$. The true definition, though, is that NP-complete is a set of languages in NP that all languages in NP reduce to in polynomial time.
But is this idea that NP-completeness implies all problems are in P if they are in ... |
I know that, T(n,m) = T(n-1,m) + T(n,m-1) + c it's the recurrence equation of Longest Common Subsequence algorithm. And the time complexity of the LCS in case of recursive method is O(2^n+m).
The base condition is: when m or n = 0, T(m,n) = 1 i.e., T(0,n)=1 and T(m,0)=1.
But, how do I derive the time complexity from th... |
I have formulated an instance of a 0-1 Integer Program (IP), which I am trying to determine the complexity of (can this instance be solved in polynomial time or not). As we know, the 0-1 IP is NP-complete, but I suspect my instance can be solved in polynomial time; which of course does not contradict the hardness of th... |
I am trying to optimize a building layout in a game, and it seems like the problem could be solved by a computer much quicker than by my own trial and error. However, I only have a cursory understanding of programming (mostly JavaScript), so I'm hoping some software exists which can do most of the work for me, or some ... |
It is given that the language is not decidable.
Is this language Turing-recognizable?
|
My understanding is that this statement regarding the halting problem is proven:
There does not exist any TM C that can, given a Turing machine A and input B as inputs, determine in a finite number of steps whether A halts on input B, and that works correctly for all A and B.
What I want to know is whether this relat... |
Got inspiration while reading history book. Inspired by: China, the cake of kings and emperors, Le Petit Journal 1898
Background:
After the Second Opium War, United Kingdom(UK), France, Russia, Germany and Japan have a meeting to dividing China the cake.
The cake have fixed size but can be break down into many small ... |
When speaking about many-one Karp reductions, the definition is stated below:
$$
A \leq_P B \iff \exists f \colon \: \Sigma^* \mapsto \Gamma^* \: \text{such that} \: (w \in A \iff f(w) \in B)
$$
where $f$ is a polynomial time total computable function. But I think this raises a bit of an issue.
I have an ongoing questi... |
I have a network of 1,000 computers that are sharing processing jobs. There are a few constraints:
Each computer has a maximum ratio of jobs it can perform
Can be higher than an equal share
Computers are not obligated to do work
Not all of these computers will be online at any given time
Jobs should be processed qu... |
I am solving a problem where I got an observation that, the vertices of the graph has an outdegree of atmost one, but My questions is using this observation ,Can it be proved that graph has either a cycle or a sink vertex in its components?
|
Hey I had this question and am stuck on part (b).
I don't see how its possible to find a graph with 7 vertices and 15 edges that does not have the half-clique problem. If there is a way, could someone share their thought process rather than the answer as I would like to figure it out on my own.
Thanks a lot!
|
Could You please recommend ordered data structures with the complexity of reading/writing/deleting not slower than O(Log2(n)), traversing O(n*Log2(n))? SkipList, Red-Black Tree, what else?
|
Let $L$ be a regular language over the alphabet $\sum$, prove that the language defined by $\hat{L} = \{uv \in \sum^* | u^Rv \in L \}$ is regular.
There is guidance in the exercise that instructs us to define for every $p \in Q$ the language:
$L_p = \{uv\in\sum^* | \delta(q_0,u^R) = p \space\space and \space\space \del... |
Why is sorting numbers Omega(nlogn)? I'm thinking of an reduction algorithm where:
For all the numbers x_i, we create a point (x_i, 0) on a 2d graph.
Fit a line directly to the right starting from the leftmost point.
Sorted numbers are the order in which we encounter the points.
Would this not be an O(n) number sorti... |
I am using past materials to review for an upcoming assignment and came across this question:
Disjoint Subset Sum:
Input: A set of integers S and a goal g(in the set of natural numbers)
Output: YES if there are at least two disjoint(non-overlapping) subsets of S where the elements of each subset sum to exactly to g oth... |
I'm studying finite state machines and trying to make this table but i don't know where to start. Isn't it necessary to know what happens when for example both inputs A and B from state s1 are active? The exercise in question doesn't say more, it just says to not consider the outputs, encode the states and inputs in bi... |
In the following discussion, we use the term old programming language to refer to programming languages which had their first release prior to the year 1990.
In old programming languages, there was a strong distinction between:
run-time functions.
compile-time macros.
In a running example, suppose that a computer p... |
Here's what Wiki says:
And here's what Mike Sipser says in his Introduction to Theory of Computation:
The problem arises when you try to read the two definitions - Mike Sipser seems to be suggesting that for a grammar to be in Chomsky's normal form, it should have all of those forms while Wiki explicitly says that it... |
This is a simple variation on precedence parsing for which I haven't been able to prove the existence of an efficient algorithm. Is this a known problem?
The setup is as follows: we are given $n$ operator nodes $x\ast_1 x\ast_2\dots\ast_n x$ connecting $n+1$ leaves (whose identity is not important, here denoted by $x$)... |
Check if these 2 regular expressions are equivalent:
$R_1 = (a+b)^*(aa+bb)$
$R_2 = (a+b)^*aa+a^*bb+b^+b$
My approach:
We check if both of these expressions generate the same set of strings. Meaning that any string that can be generated by $R_1$ can also be generated by $R_2$, and vice versa.
$R_1$ can generate strings ... |
It is known that: ${\sf BQP} \subseteq {\sf PSPACE}$ and ${\sf PH} \subseteq {\sf PSPACE}$. If tomorrow its proven that ${\sf PH} = {\sf PSPACE}$ it would also imply ${\sf BQP} \subseteq {\sf PH}$.
Query: Since, it is also widely believed that ${\sf NP} \not\subseteq {\sf BQP}$. So where does this leave us in terms of ... |
I'm reading Type Theory and Formal Proof by Nederpelt and Geuvers. Chapter 3 is about $\lambda 2$ and $\Pi$-Types (aka System F, I think?) and the derivation rule for 2nd order abstraction seems to forbid "shadowing" of the type variable; i.e. in context $\Gamma \equiv \alpha : *$ it is not possible to derive a term of... |
The stable algorithm has to run in O(n) time and must call the following unstable algorithm at least once.
EDIT: Calling unstablesort() is free (costs 0 operations).
def unstablesort(l):
return selectionsort(shuffled(l)) # shuffled(l) returns list l randomized
This is apparently an easy question but frankly I don'... |
Given an undirected graph with nonnegative edge weights and a partition of the vertex
set into terminals and Steiner vertices, the Steniner tree problem consists in finding a
minimum weight tree in the graph that contains all terminals and any subset of the
Steiner vertices.
The metric steiner tree problem is when the ... |
I want to sort a set of items, where some comparisons are expensive and others are cheap. What is an algorithm that will minimize the worse-case number of expensive comparisons?
For instance, I want to rank sports players (assuming performance is completely deterministic, i.e. a game between two players will always hav... |
I know that formally the time compliexity of an algorithm is measured in the length of the input, which in binary would be the number of bits required to encode the input.
The problem that I have with this definition is that wouldn't this definition make a lot of seemingly obvious poly-time algorithms involving numbers... |
I am currently making a 2 tape turing machine for a language that has a binary palindrome (ex: L = {x is over {0,1} | x is a palindrome }. I can assume that the tape is only infinite in one way (the right side). and when using 2 tapes, the first one contains the input, the other is empty, and both heads start at the b... |
I'm having a bad time understanding how multiple concepts work simultaneously for achieving linking/loading correctly an executable.
From the very beginning loading/linking is basically the art of putting another layer of abstraction over concrete memory addresses to achieve using the same piece of code over multiple e... |
I'm a programmer, let's start by that. The question may sound really broad, and in fact it is. I'll list some things that I know, and some other things I've doubts about under the form of questions.
My current understanding is the following:
You have a CPU. This CPU can have multiple cores. Each core runs in parallel.
... |
Are there languages that can be parsed by an LR(k) parser but not by an LL(k′) parser for any k′?
|
Let $S = \{P_1, P_2, ..., P_m\}$ be a set of convex polygons in $\mathbb R^2$ with a total of $n$ vertices. Polygons are defined by ordered lists of vertices, and each vertex is represented by a pair $(x,y)$ of its Cartesian coordinates. Polygons may have non-empty pairwise intersections.
A convex polygon is called sta... |
I was recently sorting a large list of names - I just ended up sorting it in Python, but it inspired in me the following question. If we're given a list $L$ of $n$ numbers, but can only see $k$ contiguous elements at a time and can shift a group of elements at once, what would be the fastest way to sort this list?
I or... |
The various temporal logics are particularly suitable for the specification and verification of concurrent computer programs. Are there logics that are particularly suitable for the specification and verification of multi-agent and distributed systems and algorithms? Or are the temporal logics used as-is for these purp... |
In my textbook "AI: A Modern Approach" it states that we expand a node to generate it's children.
So I understand the definition of those two words as:
Expand - Generate/create all the new children nodes of a particular node
Generating - A (child) node is generated when its parent is expanded
Now, when it comes to goal... |
Rice's theorem comments on the undesirability of non-trivial semantic properties, however there are syntactic properties that are undecidable as well, such as the "useless" states problem for Turing Machines.
What are some undecidable syntactic properties?
Can we comment on the undecidability of a syntactic property ... |
I can't find example of L not regular language that suff(L) is regular
I tried something like this:
{0^n1^n|n>= 0}, but i can't prove that it's suffix is regular
Suff(L) = {x ∈ Σ ∗ | ∃u ∈ Σ ∗ such that u · x ∈ L}.
thank you for the help :)
|
The celebrated proof that IP = PSPACE relies on an interactive proof for the QBF problem.
Is there any other "natural" interactive proof for a PSPACE-hard problem other than QBF?
(of course, since QBF is PSPACE-complete, such a proof exists via a reduction to QBF; I ask for a direct interactive proof that does not go t... |
I've seen that quantum computing calculations have their own complexity classes https://en.wikipedia.org/wiki/Quantum_complexity_theory, namely BQP and QMA.
I've heard that this would beat any classical computer, but I wonder if it would also beat a custom-made massively parallel computer. By massively parallel compute... |
Here's Alan Turing's halting problem in pseudocode:
function halts(f: Function, input: any): boolean {
// Some logic that can supposedly solve the halting problem
// ...
}
// A function that takes itself as an argument and does the opposite of what halts says
function paradox(f: Function, input: any) {
if (halts... |
[1] gives an example for PDA which contains rules of:
(p,e,Z,q,Z)
(p,e,A,q,A)
and says,
The third and fourth instructions say that, at any moment the automaton may move from state p to state q.
So, how does PDA know when it needs to move from a state to another?
[1] https://en.m.wikipedia.org/wiki/Pushdown_automaton... |
Im designing my own CPU but I don't know how it jumps to an instruction that's no longer in ram. People have told me it puts the address in the SSD but for example, if the address were 3 in ram it would most likely not be in address 3 in the SSD. someone help me I don't understand.
|
It is often said that NP-intermediate problems, such as factoring, graph isomorphism, discrete log, and so on are "harder" than the problems in P. Meaning that they cannot be solved in polynomial time.
But does this imply that all problems in P reduce to all problems in NPI?
This would imply that all problems in P redu... |
We know if $NP\subseteq P/poly$ then $PH=\Sigma_2$ Then We want to show that $\Sigma_2-SAT\in P/poly$. Now $$\phi\in \Sigma_2-SAT\iff \exists\ x\in\{0,1\}^{p_1(n)}\ \forall\ y\in \{0,1\}^{p_2(n)},\ \phi(x,y)=1$$
Now consider the language $L=\{(\phi,x)\mid \forall \ y\in\{0,1\}^{p_2(n)},\ \phi(x,y)=1\}$. This language i... |
According to the theorem(see reference) on the rigidity of frameworks:
A rectangular framework is rigid if and only if its associated bipartite graph is connected.
Now consider the case for a 2-by-2 rectangular framework.
In this case, if we draw a brace in the first and the third squares, the framework becomes rig... |
Consider a Euclidean space $\mathbb{R}^d$. Consider $ X \subset \mathbb{R}^d$ where $X$ is a finite set with $|X|=n$. Consider the set of line segments $\{xy | x,y \in X\}$ . I have a process $Z$ that I want to apply to each line segment, from smallest to largest but I will stop examining line segments when a line segm... |
Given a problem (D, c, Min) with admissible set
D={(x,y)∈R2 : |y+√3x|≤2√3,|y-√3x|≤2√3,|y|≤3}
and the price function c(x, y) = x + 2y.
Translate the given problem to a linear program in standard form. Determine the corresponding matrix A and the vectors ⃗b and ⃗c respectively.
|
In a multi commodity network, we define a demand to be a vector $d \in \mathbb{R}^{k}$, where $k$ is the number of pairs of sinks. That is, $k = \binom{S}{2}$, where $S$ is the set of sinks (aka terminals).
For example, if $\left| S \right| = 3$ we have $\binom{3}{2} = 3$ possible pairs of sinks. A demand can be of the... |
Given two problems, $A$ and $B$, that are NP-hard. Is either one of the following is true?
$A \leq_m$ B
$B \leq_m$ A
In other words, is there always a relationship between any two arbitrary NP-hard problems?
Also, I am speaking of polynomial time reductions, but I don't think specifying that will change the answer to... |
So the problem starts with a graph in which every node is connected with every node by a weighted edge. The goal is to find a weight treshold W, so that every edge that has a weight lower than or equal to W gets removed, which results in the maximum amount of connected components. A connected component is defined as at... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.