instruction stringlengths 35 11.4k |
|---|
I wonder whether there is a known relativization barrier against proving $LogCFL\neq PSPACE$. Hence I'm looking for a language $A$ for which $LogCFL^A=PSPACE^A$.
One could try $A:=TQBF$, where $TQBF$ is the $PSPACE$-complete problem to decide true quantified Boolean formulas. But relativising space-bounded classes is a... |
A language is in $\mathsf{Almost\text{-}PSPACE}$ if there is a (deterministic) $\mathsf{PSPACE}$ Turing machine with an oracle $A$ that accepts the language with probability $1$ when the oracle language is chosen uniformly at random [1,2]. (That is, the language accepted by the oracle is determined by tossing a fair co... |
I am wondering if KMP algorithm can find multiple matches in a given string when there is an overlap.
Here is an example.
Word to Search from (S): abcabcabc
Search word (W): abcabc
If you look at "W", it matches "S" from index 0 as well as from index 3
(abcabc)abc
abc(abcabc)
When I looked at the pseudo code on... |
I am having trouble understanding the class $coNP$. We defined
$$coNP = \left\{ \overline{A} : A \in NP \right\}$$
As far as I know, a language $A$ is in $NP$ if, and only if, a non-deterministic turing machine $M$ exists, which outputs $1$ if $w \in A$ and $0$ if $w \notin A$. But if this is true, then a turing machin... |
I've been studying recently some variations of the CORDIC, and it seems to me that the logic behind at least the basic cordic or the redundant CORDIC is very similar to the logic used to design digit recurrence for the division (using redundant digit set). Is this statement correct?
At each iteration they have to guess... |
For a school project I am doing on linear programming, I've implemented the simplex algorithm in Python.
I was hoping to check the complexity on a number of matrices.
Preferably, they would have to be in standard form ($Ax=b$ and $x\geq0$) (or easily put into standard form) and would have to have a finite inf (to avo... |
The question is not related to the homework
I was working on a homework, and the specification was to generate a random tree with n elements(n being in the thousands for the assignment) and asked me how many of the trees generated were RBT. I have been iterating to the millions now, so I began to wonder what was the pr... |
I'm trying to derive an algorithm or procedure I would use to have a human interactively rank a series of items based on importance by comparing a random-pairing of items at a time.
So, given an array of let's say 10 "things", I want to present two of the things, and have the user specify which is the more important of... |
Let $A(n, B, d)$, $B(n, d)$ be a {Turing machine, random-access machine, C program} with finite tape (which I'm going to denote "Turing machine*" and "random-access machine*" respectively), $n \in \mathbb{N}$. $A$ and $B$ are the same type of machine. For any $N \in \mathbb{N}$, statements where $n \leq N$, don't matte... |
Construct a Turing Machine
to increment any binary number
.
(for
example, if
the
input
is
10010 then the output will be 10011
and if the input 111 then the output will
be 1000
|
I'm reading through the Khan Academy course on algorithms. I'm taking a quiz and finally got the right answer (all 3 of the options are true).
For the functions $\lg n$ and $\log_8 n$, what is the asymptotic relationship between these functions. Select all that apply.
[ ] $\lg n$ is $O(\log_8 n)$
[ ] $\lg n$ is $... |
So when I play a video, that means the video is moved from backing store to main memory. Then if I remove my laptop's battery all of sudden, that means the video should get lost as main memory is volatile. Why doesn't this happen though?
|
Suppose that we have a formula A which is valid in all states of Kripke structure and some transition relations. Is it generally possible to derive if formula A is common knowledge between particular agents directly from the structure?
|
Suppose that $G = (V, E)$ is an undirected graph, and $G$ is promised not to contain $C_{k-1}$.
Goal is to find any $C_k$ in $G$ using an efficient algorithm. Efficient, in this scope, meaning that finding all cycles and excluding all $C_{m>k}$ is out of question.
First thing comes in mind is to use depth-first search,... |
Let $L$ be a regular language with alphabet $\Sigma = \{a,b,c\}$.
Prove that the following language is regular:
$\{w | w \in L \text{ and } w \text{ starts with } abc \}$.
I wonder what proof strategy I can use to prove this.
|
Are there NLP algorithms dealing with detecting the repeating
patterns in a a list of texts from which a topic keywords
and other associative keywords can be derived?
I will show it as an example:
You have a search query "vegan food for something health"
(where something is a part of body you need an advice about).
The... |
I'm trying to build a complexity analysis tool and I need an algorithm for constructing the control flow graph (to get cyclomatic and eventually essential complexity). I couldn't find any pseudocode online so I just got down to writing it. Using recursion seems to have been a bad way to go; my code handles most simple ... |
My question is
Accept all strings containing “ 011 ” or “ 001 ” as a substring and should not contain “ 010 ” as substring
for the following languages over the alphabet {0,1}
i have solve it but , i have doubt if i can make the string contain 010 as substring goes to dead state ?!!!
|
Yes, this is homework.
I need help knowing how to begin this problem:
Let A be an algorithm that finds the kth largest of n elements by a
sequence of comparisons. Prove by contradiction that A collects enough
information to determine which elements are greater than the kth
largest and which elements are less tha... |
This is the question:
A spreadsheet keeps track of student scores on all the exams in a course. Each row of the spreadsheet corresponds to one student, and each column in a row corresponds to his/her score on one of the exams. There are r students and c exams, so the spreadsheet has r rows and c columns. Devise an al... |
Designing CFG for the following language $\{a^nb^m \hspace{0.2cm} | \hspace{0.2cm} n\ge0, m\ge0, n\le m \le 2n \}$ is easy.
$S \to aSb \mid aSbb \mid \lambda$
Then how about this? Language $\{a^nb^m \hspace{0.2cm} | \hspace{0.2cm} n\ge0, m\ge0, n<m<2n \}$.
It is somewhat difficult for me. I have no idea how to exclud... |
I am trying to convert a regular language to a context free grammar. The language is $L=\{a^n b^m c^k |n=m\ or\ m\le k\}$, my solution is: assume $m,n,k\ge0$
$S\to AS|BS|\lambda$
$A\to aAb|Ac|ab$
$B\to Bc|Bbc|aB$
Is this correct? Can somebody explain why it is correct or not correct?
|
Here is a code point: U+091D. The symbol it represents in UTF-8 is झ. In hex the symbol requires three bytes: e0 a4 9d. But it looks like the number 091D requires two bytes. So why do we need three bytes to encode the symbol? Probably due to
the restriction of the Unicode code-space to 21-bit values in 2003
Please se... |
I've been reading that to terminate a TCP connection 3 handshakes are required: FIN, FIN ACK, and ACK. However, when closing a connection, Wireshark displays FIN ACK, FIN ACK, ACK; it never displays FIN by itself.
However, when establishing a connection Wireshark clearly displays the three handshakes: SYN, SIN ACK, ACK... |
Since logical memory maps to the RAM (physical memory) it has be stored somewhere right and it will obviously take large bunch of memory of itself. Where is it stored?
|
I have to prove with the pumping lemma that $L$ is not regular or to give a regular expression for that.
Let $L$ be all combinations of commands such that in the complete drawn result no line is drawn above another. At the starting point the pen is down.
The turtle graphic is created by the following commands:
u - ... |
According to this wikipedia link, under the title "Success probability of the contraction algorithm":
Number of possible cuts in a graph is $2^{n-1}-1$, while maximum number of minimum cuts is ${n}\choose{2}$, where $n$ is number of vertices.
My question:
Why number of possible cuts differ from maximum number of minimu... |
I read one of those popular papers on cubical type theory, but no wonder I could only see formulas and diagrams without being able to recognize them at all.
So here's what I want. I want a deep enough explanation of what composition, Kan filling and gluing have to do with homotopy type theory. I don't expect there coul... |
As seen here:
It works same like multiprogramming with fixed partition and also the memory is contiguous as well. How is it different and especially non-contiguous? What's happening here?
|
Is there a way to support adding characters in the middle and update the hash in O(1) ?
All I have is the hash of ABBDE and I want to get the hash of ABBCDE.
|
Here $M$ denotes a turing machine.
By set theory, $L = \overline{E_{TM}} \cap \overline{L_0} \cap \overline{L_1}$ where $L_i=\{\langle M \rangle \mid |L(M)|=i\}$. And I know that $\overline{E_{TM}}$ is recognizable.
That is about all I know at this point. I suppose I need to use mapping reducibility to prove $L$ is not... |
Let $A=(a_{ij})$ and $B=(b_{ij})$ be $n \times n$ integer matrices. Then $AB=(\Sigma_{k=1}^n a_{ik}b_{kj})_{ij}$. I am interested in finding the most efficient algorithm for computing the product of the entries of $AB$,
$\Pi_{i,j=1}^n (\Sigma_{k=1 }^n a_{ik}b_{kj}$).
Certainly, the most straightforward way of doing th... |
I am a beginner in coq and want to prove the following theorem t1. First I used induction i and destruct j, but it got bogged down in the middle.
I would like some hints for this problem.
Function f takes two arguments of nat and returns Prop (e.g., f 2 4 = x 2 ∧ x 3 ∧ x 4 ∧ x 5).
Theorem t1 shows that a head of funct... |
My question is related to the space-time complexity to find the values of n and c by considering this question.
AS we have seen that there are multiple solution for the above equation is possible. But I am confused which one we have to consider.
In solution1: nO = 5 and c = 101 ; this states that we are considering ... |
I have a problem with this following question:
Prove that the language $\{uw : |u|=2|w|\}$ is regular.
I tried to give this regular expression $(uw²)^*$ to resolve it.
|
Given a representation $g$ (e.g. the Gödel number) of a Turing machine $B$, a universal Turing machine $A$ can simulate $B$.
If $B$ is restricted to using at most $n$ memory cells of its tape and the memory cells of $A$ and $B$ can assume the same number of states, how much space does $A$ require at least to simulate a... |
Does it exist an algorithm to find a median of table with a complexity nlog(n)
Thank
|
For advancing the
address input of the RAM, we provide the
signal “strobe”.
Can anyone explain this in a bit more detail?
Thanks.
|
Here is an imgur folder with the projects description (my apologies for the awfully wrinkled paper): http://imgur.com/a/a2vQM
There are a set of pegs, numbered from 0 to n - 1. Each peg can have a connection to another peg with a rubber band.
Basically, the program is given an adjacency list with all of the pegs and th... |
I'm trying to solve a recurrence using the master method:
$T(n) = 10*T(n/3) + n^2\log^5n$
I set up the comparison
$n^2\log^5n$ and $n^{\log_3 10}$
and reduced them to:
$\log^5 n$ and $n^{\log_3(10/9)}$
I'm struggling to understand how these functions compare asymptotically.
From one side I understand that in general p... |
The definition of the universal Turing machine is
$$
U(\langle M \rangle,p)=M(p)
$$
where U is a universal Turing taking two inputs $\langle M \rangle$, the binary encoding of a Turing machine, and $p$ a binary program.
What happens in the case where we feed the null Turing machine to the UTM.
$$
U(0,p)=?U(p)?
$$
Will... |
I have a dataset of about 26,000 words along with their gender tags [m, f or any]. Which ML algorithm should I use for Gender Tagging/Classification purpose. How should I go about it? What should be the input features?
Given a word , it's Part Of Speech tag and in some cases the singularity I am trying to predict the g... |
I have a list of people's locations on a world map and want to pair nearby people up such that the number of pairs is maximized.
For example, subject to the constraint that paired people are within d=10 miles of each other, I might find 742 pairs from a list of n=3000 people's locations.
Possible considerations:
alr... |
I would like to see the proof or a refernce to it. I feel it is obvious but my tutor insists the other way (agnostic PAC is a subset of PAC, and there are problems in PAC that are not angostic PAC).
|
I am working on a project where I refer to the RAM model, I explain what it is, but I am not sure who defined it first.
The wikipedia article is not very explicit about it, and the first citation is from 1946.
Goldstine, Herman H., and von Neumann, John, "Planning and Coding of the Problems for an Electronic Computing ... |
Basically I want to prove that the set of all c-compressible binary strings is recognizable.
My goal is to construct a turing machine $N$ such that, given an input string $x$, $N$ accepts $x$ if there exist a turing machine $M$ and a string $s$ such that $M(s) = x$, and $|\langle M \rangle|+|s| \leq |x|-c$. Since both ... |
I am trying to more deeply understand the difference between Hidden Markov Models and Bayesian Network? The general idea is that HMMs have a single variable which has probabilities of entering different states, known and unknown, whereas the Bayesian network relates multiple random variables.
So, given that, what would... |
In the introduction of Distance-Sensitive Bloom Filters the authors state:
The relative Hamming distance between two Bloom filters (of the same size, and created with the same hash functions) can be used as a measure of the similarity of the underlying sets.
This statement is followed by a reference to another paper,... |
There are two nice tree constructions, that use a stack in a similar manner:
Construct a binary search tree from a pre-order traversal (e.g. see http://www.geeksforgeeks.org/construct-bst-from-given-preorder-traversal-set-2/)
Construct a Cartesian tree from an array of numbers (e.g. https://en.wikipedia.org/wiki/Carte... |
I have an undirected graph which may or may not contain a 'bridge'. I'm defining a bridge as a relatively narrow connection between two larger clusters. Take for example the following graph:
A----B
\ /
\/
C
|
D
|
E
/\
/ \
F----G
In this example D would be considered the 'bridgiest' node, because it c... |
I have a Compiler Design course this semester but unfortunately the professor teaching this course have some issues with text book which is Compilers, Principles, Techniques & Tools by Alfred Aho and others.
For the section Intermediate Code Generation there is a slide which introduce a method to do so. I provide a pho... |
I have an algorithm here and it wants me to calculate the complexity:
for (i=1;i<n;i++)
for (j=1;j<i*i;j++)
if (j%i==0)
for (k=0;k<j;k++)
sum++;
First of all, I think that i have different complexities for best, average and worst case but I don't know how to find them. I have one though and I sa... |
I have the following grammar:
S -> Xb | Y
Y -> X | a
X -> S | c
Here the lowercase letters are terminals.
I have an algorithm to find the cycle in this grammar. It is S->Y->X->S and in fact there is a smaller cycle buried in there, namely S->X->S.
I've tried to devise an algorithm to remove these cycles, without too... |
I'd like to prove that $\sqrt n\log{\sqrt n}=\Theta(n)$ but I'm not sure how to do it.
This is my attempt:
$$
\lim_{n \to \infty}\frac{\log{\sqrt n}}{\sqrt n}=0 \Rightarrow \log{\sqrt n}=o(\sqrt n) \text{(Little o)}
$$
Therefore:
$$
\sqrt n\log{\sqrt n}=o(\sqrt n\cdot \sqrt n)=o(n)
$$
But this is too much as I need th... |
In Brin and Page's paper "The Anatomy of a Large-Scale Hypertextual Web Search Engine", they describe the variable "d" in the PageRank algorithm as the probability that a random surfer requests a new random page. On the next line, they state:
One important variation is to only add the damping factor d to a
single pa... |
I need to write an algorithm which will sort an array $A[1..n]$ with $\sqrt n$ distinct elements in $\Theta(n)$ time and $\Theta(\sqrt n)$ space?
The solution must use hash-tables and advanced data structures including any variation of trees is not allowed.
I thought of the following:
1 Sort(A, n)
2 init B[2][sqrt(... |
Given two strings how can you check if they are a permutation of each other using O(1) space? Modifying the strings is not allowed in any way.
Note: O(1) space in relation to both the string length AND the size of the alphabet.
|
if H is Pac learnable according to
Definition 3.1 (PAC Learnability) A hypothesis class H is PAC learnable
if there exist a function $m_H\colon(0,1)^2 \mapsto N$ and a learning algorithm with the
following property: For every $\varepsilon, \delta \in (0,1)$, for every distribution $D$ over $X$, and
for every lab... |
I am searching for 2 examples.
At the bottom I give definitions I am using.
An example for H that is PAC learnable (according to 3.1) but not Agnostic PAC learnable (according to 3.3). We learned that such should exist. I saw in another post a comment that 3.1 and 3.3 are equivalent but i can't comment there (permissi... |
In order to determine how much value employees provide to a company, I want to build a system that goes beyond basic math in terms of sorting said employees. I'm working with values like current salary, number of people working under them, and a value from 1-3 of how indispensable they are to the company. What method... |
Are there any closure properties which I can use to come up with a contradiction?
|
There is this case of concatenation that says (from wikipedia):
The initial state of N(s) is the initial state of the whole NFA. The final state of N(s) becomes the initial state of N(t). The final state of N(t) is the final state of the whole NFA.
My question is, does this mean that the final state of N(s) is linke... |
Suppose $X$ is a set of integers. I am interested in the algorithm which computes the number of ways to represent an integer $W$ as a sum of exactly $k$ elements from $X$. Is it possible to modify the standard knapsack algorithm so that it does the job? Thank you for your suggestions!
|
I have implemented Vitter algorithm thanks to the Wikipedia article. However I don't really understand how some parts of the algorithm make the algorithm more efficient:
IF (new p is sibling to NYT) THEN
leaf_to_increment = p
p = parent of p
Here I don't understand why is the condition neces... |
I have a graph as given below:
Let us assume one node as transmitter and another as receiver.
We need to transfer particles in every time slot constrained by maximum particles N and minimum 0. The combination of which particle in which time slot makes a code. I mean if 2 1 0 0 is a code that means that 2 particles i... |
Assuming that someone will find poly-time algorithm that statistically is wrong on ~1% of total (already runned) instances (which are very different), will it be a proof for $\mathsf{BPP = NP}$?
|
Let's say you are given a set with $V$ vectors and you are given a simple Euclidean distance metric $d(a,b)$ for $a, b \in V$. Then what would be the most efficient algorithm to build a subset $S$ of a desired size $k$ such that the sum of the distances between the elements of the subset is maximized?
In other words, h... |
I've been banging my head against the wall for the past two days and can't seem to come up with anything useful. The problem that needs to be solved is the following: I get an array of integers and I must return an array containing the elements that would give the maximum sum with the following condition: If I select a... |
I have a vector $v \in \mathbb{N}^k$ and a set of vectors $R \subset \mathbb{N}^k$, with $k \ll \left\vert R \right\vert $.
I would like to find a way to obtain all the possible bases of $\mathbb{N}^k$ taking $k$ elements from $R$.
The ultimate goal is to find a decomposition of $v$ over a subset $S = \left\{ r_1, r_2,... |
I'm looking for an algorithm for meshing parametric manifolds in a given range. To be specific, in n-dimensional space, the manifolds are given as $$x=e^{At}x_0$$ where $x_0$ are the solutions of a linear equation $$Fx=g$$
$x_0$ is an (n-2)-dimensional linear set. For example, in 4-dimenional space, $x_0$ is a 2d plane... |
This is my first question here and I hope you can help mt clarifying a doubt.
Basically, I'm studying shortest path algorithms, for instance Dijkstra, Bellman-Ford-Moore, and I came up with a doubt.
From what I understood, given a node of a graph, these algorithms calculate all the shortest paths to the other nodes. So... |
Supposing we had a quantum computer with a sufficient number of qubits, could we use it to do linear algebra faster than we could with a classical computer? What sort of speedup could we expect? Has anyone created a quantum algorithm for linear algebra, and what is it's running time? In theory, an operation such as mat... |
Given $N$ points in 2D plane, and each point has some value. Have to answer $Q$ queries of the form:
Given $x_1, x_2, y_1, y_2$, find sum of values of all points $(x,y)$ such that $x_1 \le x \le x_2$ and $y_1 \le y \le y_2$. $N$ and $Q$ are $\le 10^6$. Also it will be helpful if someone can provide implementation.
|
Given a Weighted Partial Max SAT problem (WPM-SAT) - are there generally used algorithms or techniques to generate 'approximate' solutions, which are
not necessarily optimal, but found faster than solving directly? The approximate solutions must satisfy the hard clauses.
Context
I have a series of very large (millions ... |
I have done code for the algorithm to obtain the Optimal Basis but as I calculate the optimal solution $Xb=B^{-1}b$, I only get the correct value for some of the variables. For some variables, $Xb_i$ is not equal to the $X_i$, where $X_i$ is the result of some LP solver, used in Megiddo's algorithm.
What can be the pos... |
What I want to achieve is to build a neural network with Keras which will have to stabilize
a quadcopter I've built. The network would have three inputs: pitch, roll, yaw, acceleration x, accel y and accel z and four outputs: pwm length for motor 1, 2, 3 and 4. The problem is that the length of the pwm wave needs to f... |
f[1](2, 3, 20) : 10011010
f[2](4, 20, 21) : 10101001
f[3](4, 20, 22) : 10010110
f[4](2, 4, 23) : 10011010
f[5](5, 23, 24) : 10101001
f[6](5, 21, 23) : 01101001
f[7](2, 5, 26) : 10011010
f[8](2, 3, 33) : 10101001
f[9](3, 22, 33) : 10000110
f[10](3, 21, 40) : 10100110
f[11](3, 21, 41) : 01101001
f[12](21, 41, 42) : 10101... |
Problem Statement
Let, $G(V,E)$ be a graph with a weight function $w(v)$ defined for all vertices. We need to find a tree $T(V',E')$ such that the resulting tree have maximum sum of weights of vertices, where $V' \in V$ and $E' \in E$. In short, we need to remove some vertices(along with all their edges) from $G(V,E)$ ... |
I have an if-then-else condition with three binary variables $A$, $B$ and $C$:
if A = 1
then B = 1
else
B = C
How do I express this as an integer linear program with equality constraints?
|
The algorithm to partition a polygon into y-monotone pieces is as follows:
Input. A simple polygon P stored in a doubly-connected edge list D
Output. A partitioning of P into monotone subpolygons, stored in D
Process:
1. Construct a priority queue Q on the vertices of P ,use y-
coordinates to deter... |
$\mathsf{XP}$ is the class of problems with input length $n$ and parameter $k$ than can be solved in $O(n^{f(k)})$ time, where $f$ is a computable function. It's described on the complexity zoo page as "Fixed-parameter Tractable for Each Parameter", but I fail to see how adding "for each parameter" to the description c... |
I'm trying to figure out a good way of encoding object segmentation data into a single RGBA image. I'd like to not only distinguish between classes, but also individuals within classes, and be able to have multiple classes and objects per pixel.
For example, I could have a pixel represent both "road sign" and "speed si... |
Given function rand7 returns random integer in interval [0, 6]. Your task is to implement function rand5 which should return random integer in interval [0, 4] using function rand7.
This is a question from my book. So, this is how I solved it (the algorithm is written in C):
int rand5(void){
return (int)(rand7() * 4... |
I'm studying the chapter "Division by Digit Recurrence" in "Digital Arithmetic" of Ercegovac. I like this book is overall well written. Although sometimes I struggle understanding some aspect like the one I'm about to expose.
First of all let me give some introduction to the method, almost everything is taken from the ... |
Given P=!NP
Is there a polynomial time TM such that for an input of formula and a satisfying assignment will yield a different satisfying assignmentif such exist?
|
I would like to have a compact conceptual explanation that allows me to gain some feeling with the concepts. The following list uses $x_i, y_i$ as events of experiments $X, Y$.
Self-information, denoted as $I(x_i)$
Mutual information, denoted as $I(x_i; y_i)$
Uncertainty (which is closely related to self-information ... |
Design a minimum state deterministic finite automata for accepting those strings over the alphabet $\{a, b\}$ whose last but one symbol is $b$.
|
I have a certain kind of graphs. They are DAGs similar to dependency graphs but strictly hierarchical, that is, each node belong to a certain level in the hierarchy and cannot be moved up or down when the graph is laid out onto a plane. The nodes can be arbitrarily exchanged with others in the same level.
Here's an exa... |
How to encode a sequence of n non-decreasing integer of [0, ..., m] fulfilling the following conditions:
no or minimal redundancy
only use 1 integer variable or k independent integer variables with a range of [0, ..., j(k)], It means there exist an inverse function f-1(x) to map the encoded sequence, an integer x of t... |
I guess I lack at understanding basic things at algorithm calculations, while learning for an exam.
at the result, does one write like O(ld n) or just log instead of ld ?
regarding the following calculation (not from me) at the yellow mark - why is it Theta(n) ? why not O(n) ? I dont get it..
big thanks in advance !... |
I was hoping someone could help me with this question, since I'm having trouble determining what approach to take.
Let $L \subseteq \{0,1\}^*$ be a regular language. Show the language $\{w \in \{0,1\}^* | 1w \in L\}$ is also regular.
My idea is that whenever we're at the start state to compensate for the lack of the 1... |
The book "Algorithms" by Robert Sedgewick and Kevin Wayne hinted that (see the quote below) there are efficient algorithms for finding shortest paths in undirected graphs with possibly negative edge weights (not by treating an undirected edge as two directed one which means that a single negative edge implies a negativ... |
I need to prove that TAUT is coNP-complete. I showed that $\text{TAUT} \in \text{coNP}$ by reducing $\text{SAT}$ to $\overline{\text{TAUT}}$. However, I cannot figure out how to prove that every problem in coNP can be reduced to $\text{TAUT}$ in polynomial time. To do that, I would need one of two things:
A known coNP... |
According to https://www.heroescounters.com/teampicker a Hero has a synergy value with another hero, Heroes of the Storm have 60+ heroes each one with a synergy value for example:
HeroID Synergy.With.HeroID Synergy.Points
1 2 97
1 3 95
1 ... |
I am trying to understand closure properties between different language classes. For example, if L1 is regular and L2 is recognisable, then is L1 intersection L2 decidable? My answer is that L1 is also recognisable and therefore L1 intersection L2 is recognisable. However, this cannot guarantee that it is decidable. Is... |
We defined the class $\text{DP}$ like this:
$$\text{DP} := \{ A \setminus B : A, B \in \text{NP} \}$$
We say a problem $P$ is $\text{DP}$ complete iff $P \in \text{DP}$ and $X \leq P \forall X \in \text{DP}$, meaning that every language $X \in \text{DP}$ can be reduced to $P$ in polynomial time.
For a particular proble... |
Could we design a Turing machine that output every bit of $\pi$ one after another correctly?
I think we have computer programs that calculate the value of $\pi$ day after day, and thus it's viable.
Could we do that if the Turing machine has a limited tape length?
|
I have seen the term "approximation oracle" in computer science papers, sometimes parameterized with the letters $\alpha$ and $\beta$. What is an approximation oracle? How are such oracles used? I am somewhat familiar with the idea of an "oracle machine" in complexity theory.
|
In my understanding all SQL injections need to add another operation to the one intended by the programmer.
For example, a badly written query:
query="Select * from Table where name="+name;
User inputs name as: foo; Delete from Table; and this would be an SQL Injection.
But if the programmer would be able to limit the... |
I was reading JeffE's (Prof. Jeffrey Erickson) notes on solving recurrences, and he used Merge[A[1,...n], m] where A is an array(I think) and m is an integer. What does this mean? I thought Merge sort took two arrays as input. He includes psuedo code, but I can't decipher what is means. What is it doing?
Thank you for ... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.