instruction stringlengths 35 29.1k |
|---|
The Wikipedia article on temporal logic lists many varieties of temporal logic, such as LTL (linear temporal logic), CTL (computation tree logic), CTL*, and others. Which of these is the logic described in Manna & Pnueli's textbook The Temporal Logic of Reactive and Concurrent Systems: Specification?
I've started to re... |
I came across the following problem in the book "Elements of Programming Interviews in Python".
Given an array A of n objects with Boolean-valued keys, reorder the array so that objects that have the key false appear first. The relative ordering of objects with key $true$ should not change. Use $O(1)$ additional space... |
With recursive-descent parsing, direct/indirect left recursive rules do not allow top-down parsing.
How would this grammar be converted to be non-left recursive?
S-> Aa | b, A -> Ac | Sd | epsilon
I have gotten this far but I am not sure if it is correct.
S-> bS'
S'-> epsilon | AaS'
A-> SdA'
A'-> cA'
I wasn't sure if... |
Could someone help explain the logic of the ms .
The question is
The RandomChar() module is to be modified so that alphabetic characters are generated
twice as often as numeric characters.
Describe how this might be achieved.
and the marking scheme says
my logic is that if you randomly generate an integer between 1 a... |
Suppose given two sets $\{a_1,a_2,\dots,a_n\},\{b_1,b_2,\dots,b_n\}$ of positive real numbers.
We try to find a subset $I\subseteq\{1,2,3\dots,n\}$ such that:
$\sum_{i\in I}b_i$ maximized and $\sum_{i\in I}a_i\leq 5$.
I think this problem is NP-hard but I can't reduce from famous problem like partition problem. Any hel... |
I have seen this C code showing an implentation of Peterson's Critical Section algorithm. It is obviously skeletal and hardwired for two threads but the logic is supposed to be correct in detail.
Despite reading and talking I remain with a grain of doubt about the following line (and the similar line for Thread B):
`... |
Can we have an algorithm that takes some input and does something random to it (in such a way that the algorithm does terminate) which does not have a worst-case running time upper-bound?
A (non-)example which shows what I mean: If let's say that my algorithm is one that takes an input number, generates a random number... |
This is the given question-
Construct a DFA over the alphabet {0,1} such that it accepts all strings containing
even number of 0's OR the number of 1's divisible by 3.
The very first problem I've encountered was the 'or' mentioned in the question. Does this mean i just '+' the RegEx for -'accepts all strings containi... |
Michael Sipser's Introduction to Theory of Computation:
Is there a typo in the highlighted line? I ask that because near the beginning it says that R is a set of states of N, and that R itself is a state of M.
It also says that E(R) is 'the collection of states that can be reached from members of R by going only along... |
From 6.3.2 of Aho et al.
When type expressions are represented by graphs, two types are
structurally equivalent if and only if one of the following conditions
is true:
They are the same basic type.
They are formed by applying the same constructor to structurally equivalent types.
One is a type name that denotes the o... |
Consider two binary search trees T1 and T2, each with height h, with all values in T1 less than all values in T2. I want to merge these both trees to get a new binary search tree of height at most h+1
My Thoughts:
The first thought was to put T1 as the left child of the leftmost node in T2. But the resulting bst will h... |
Consider two red-black trees T1 and T2, each with black-height h, with all values in T1 less than all values in T2. How to merge these two trees to obtain a red-black tree in O(h). The root is always considered black in the red-black tree
|
Consider a DAG such as one shown below:
How do I find a particular topological order of nodes, such that when the nodes are placed in a straight line, the maximum number of unique-edges that cross through any node is minimized. Unique edges are edges that originate from unique nodes. So, if two edges are originating f... |
Consider the alphabet $\Sigma = \Sigma_c \cup \Sigma_i \cup \Sigma_r$ separated into call, internal, and return letters. Assume that $c \in \Sigma_c, r \in \Sigma_c$, and $a \in \Sigma_i$.
I have a question regarding whether the language:
$L = c^n a c^* a r^n$ is accepted by some Visibly Pushdown Automaton or not. $L$ ... |
The N-Queens in question is referring to the one where it is interested in finding all solutions for some natural number n. I just read about the idea of a verifier being an algorithm that verifies whether it accepts an input and a "certificate".
So say for example that I want to check some configuration of n queens in... |
The most widely used notion of equivalence of regular expressions
$r_1$ and $r_2$, or finite state automata ${A}_1$ and ${A}_2$ resp., over an alphabet $\Sigma$, is to consider their languages: we can define
$$r_1 \cong r_2
\qquad\text{iff}\qquad
\mathsf{language}(r_1) = \mathsf{language}(r_2)
$$
and likewise for ${... |
This idea blows my mind, I would appreciate for any guidance. In essence, the question is how a machine should work to transform any kind of formal logic into its graphical representation (e.g. conceptual graph)? And moreover, from graphs into linear form.
I have heard about ISO standard for Common Logic framework. It ... |
I have a problem to solve, but I am having some issues with it...
Find an algorithm with time complexity O(V+E), where V and E stand for vertices and edges respectively. The algorithm searches a tree graph for a subgraph. The subgraph is supposed to be the so called caterpillar graph, i.e. a path with "legs" or "hair" ... |
I've read that in general for a modal formula P, a world w and a Kripke frame ⟨W,R⟩
w⊨□P if and only if for every u∈W, if wRu then u⊢P
In case of LTL, being a modal logic, I assumed that the worlds are different moments in time and the relation R is the chain of "arrows" between those moments. However, in this case the... |
I have recently discovered a greedy algorithm to construct De Bruijin Sequence.
The greedy approach (prefer-largest specifically) works like the following:
Start with a sequence of all 0's of length n - 1 where n is the order of De Bruijin Sequence.
For k^n times (where 0...k-1 are the possible digits in the strings i... |
(I reorganized my question.)
We have a function $f$ mapping the integers $\{1, . . . , 2^k\}$ ONTO the integers $\{1, . . . , 2^k \}$ such that when these integers are represented in binary, and $f$ is polynomial time computable but the inverse function $f^{-1}$ is not polynomial time computable. Define a language $L =... |
I am currently working on parameterized complexity, especially on the hard proofs. There is a problem that I am currently working on, denoted by $P$ and a parameter $x$, I discovered that there is no parameterized reduction for $P$ w.r.t the parameter $x$ from any W-class. I have tried to give a reduction from a W[2]-h... |
I am going to story data in a growable persistent storage. I need to implement allocation/deallocation (like malloc/free and possibly realloc but in Rust) of continuous regions of memory on this storage.
Allocation should never fail, but the storage grow if out of allocated storage.
Priorities:
Should do alloc/dealloc... |
Is the answer O(h) or Ω(h) for f+g?
My professor says its Ω(h), but I can't get it.
|
As a reminder, in an A* algorithm, vertices in the priority queue are sorted according to their priority $f = g + h$, where $g$ is the cost of getting to this vertex from the start vertex, and $h$ is an estimation on remaining cost to get from this vertex to the destination vertex. In my specific A* path finding algori... |
Originally posted on SO.
I have a very simple language that gets compiled to an Expression tree, and then evaluated. Users can define mathematical operations, use variables and control flow. Moreover, from the script it's also possible to read an external input, which is fixed for a given evaluation (i.e. it outputs th... |
In lambda calculus (I will use untyped) if a term containing a redex is beta-reduced to another term, then for some reason they are considered "beta-equal". But the lambda calculus only works one way!
Assume that 3 conditions are met:
The original term is finite (for simplicity: it consists of a finite number of chara... |
In what paper(s), textbook(s), and/or classnote(s) can I find a detailed proof of the completeness of a certain proof system for PLTL (Propositional Linear Temporal Logic)?
|
Does 2^n describe a class of problems or is it considered polynomial?
|
When it comes to defining the memory address structure given the RAM size, cache size, and other parameters such as the cache block size..., we can have the following generalization:
$$Address = TAG|Index|offset$$
We then have: $size(offset) = log_2(word \ count \ per \ block)$
For the index, we will have: $$size(index... |
Is there a reduction between a decidable language $L$ and $\Sigma^*$?
|
Let $L \in RE$. Then $L$ might be finite or infinite.
I assume this is also true for $coRE$.
But, if I have a language $L \notin RE$, it necessarily means that $L$ is infinite, am I correct?
Also, if $L \notin coRE$ then $L$ is infinite, right?
Thanks a lot!
|
Let $p_1,p_2 \dots p_n$ be $n$ points in 2D such that $p_i= ( x_i,y_i) $
Let $d(p_i,p_j)= \max (|x_i-x_j|,|y_i-y_j|)$, or better known as Chebyshev distance.
Find a point $p_i$ such that the distance to it's kth closest point is minimal among all $i$ in $\mathcal{O} ( n\log ^2 n) $.
Edit: $ 1 \le k \le n$
I tried calcu... |
Complexity class P/poly includes languages, which cannot be calculated by means of classic Turing machine, including unary halting problem
However, class NP is relatively simple, can be calculated via Turing machine and is placed on lowest level in polynomial hierarhy
So every NP-complete problem, which can be represen... |
I think anyone would agree that assembly languages ("threshold languages") have some very little abstraction but is it true to say that also machine languages have some degree of abstraction?
|
This is a problem from my Algorithms course in uni
There are $n$ students, each have a single book. They come into a party to exchange books among themselves. Each have a list of students that have the book that they want.
Give and prove an algorithm that says if a switch of books is possible, i.e. every student got th... |
I have a practical programming problem that I am struggling to find an optimal algorithm for, in part because I don't know what to call it. The problem concerns vectored I/O (scatter/gather).
Consider a server s and a set of connected clients C. The server maintains a contiguous array B of variable-length blocks of dat... |
Suppose you have three modules $m_1,m_2$ and $m_3$, each with a capacity of $c_i$ and area $a_i$. You are also given $A$ and $C$. How can you find some of the solutions to choose an amount of each module so that the sum of areas is exactly $A$ and the sum of the capacities is exactly $C$? All variables including the am... |
Given an adjacency matrix or other data based on the nodes, there are many algorithms for determining whether the graph is acyclic (e.g. row reduction or leaf trimming).
If I have only a set of edges (e.g. ${(a,b), (b,c), (d,b)}$), I could obviously convert that into an adjacency matrix and proceed from there.
I'm wond... |
Define a graph problem as follows. Given a graph $G$ and
two integers $c$ and $k$, delete $k$ nodes and all edges incident to them, such
that, in the remaining graph, every connected component has at most $c$
nodes.
What can I say about the time complexity class of the above problem? I can easily prove that under the c... |
I'm trying to break down the Time complexity algorithm for IDDFS. Acknowledging that in general my understanding of maths is not that great. So I will be trying to talk things out.
For BFS it is intuitive to me that we take the exponent of each level of depth since we are expanding all nodes.
For IDDFS, the equation t... |
Assume $$C_1 = (x_1 \lor x_2 \lor \lnot x_3)\hspace{0.2cm} C_2 = (x_4 \lor x_5 \lor x_3) \hspace{0.2cm} C_3 = (x_3 \lor x_5 \lor x_6)$$ Let
$$ \phi_1 = C_1 \land C_2 \land C_3$$ and
$$ \phi_2 = (x_1 \lor x_2 \lor x_4 \lor x_5) \land (x_3 \lor x_5 \lor x_6)$$
Question
Are the two formulas $\phi_1, \phi_2$ equisatisfiabl... |
Say that I am given a graph $H$ and a graph $G$ where the maximum degree of $G$ is known. How can I use BFS to find out if $H$ is an induced subgraph of $G$ in $O(n)$ time?
My current take is the following:
Run BFS on $H$ and take note of the layer depth.
Assume I have a function $g(x)$: $H_{nodes}$ -> $G_{nodes}$, wh... |
Given a finite set of integers $Z$ and a number $z$, I would like to check if there exists a subset $A=\left\{ a_1,...,a_{\left| A\right|}\right\}\subseteq{Z}$ and a set of $\left| A\right|$ numbers $k_1,...,k_{\left| A\right|}$ such that:
$$ \sum_i k_i \cdot a_i = z$$
It is a generalization of regular subset, and seem... |
Given two sets of values $a_1, a_2, ... a_n$ and $b_1, b_2, ... b_n $ what would be a good way to shuffle them together while keeping $a_i$ and $b_i$ at least $gap$ spots apart?
For example, if we have A B C and a b c, then b A C a B c is a valid 2-gap shuffle, but not a valid 3-gap shuffle (because of the a's placemen... |
I've been reading the following paper (open) by Fraenkel and Lichtenstein that shows that the Generalized $n \times n$ Chess problem ($\texttt{CHESS}$) is $\texttt{EXPTIME-complete}$. They start by proving that $\texttt{CHESS}$ is in $\texttt{EXPTIME}$, but I don't understand at all the fragment highlighted in pink (th... |
I'm really confused when it comes to what the difference between bias and threshold is. I have read that they are basically the same thing and that they serve the same purpose. Being on opposite sides of the equation, though, they are "negatively proportional".
The equation for the separator for a single-layer percept... |
as the title says
Can we solve a decision problem with two identical answers like $false\equiv(\lambda f.\lambda y.y)$ or $0\equiv(\lambda f.\lambda n.n)$?
if no why? and if yes then why can't we decide whether a lambda term is in normal form or not?
thanks
|
Someone suggested to me that the halting problem could be solved by a lambda calculus "program", which reduces to $\lambda y.y$ if an input program halts and $\lambda n.n$ if it does not. Therefore it is not possible to extend this into a program that halts if it thinks it doesn't halt. (That's just background, not the... |
I don't get why SCAN is used when LOOK exists. Why move to the end, when there are no longer any pending requests in that direction?
SCAN: In SCAN algorithm the disk arm moves into a particular direction and services the requests coming in its path and after reaching the end of disk, it reverses its direction and agai... |
How decidability/semi-decidability/undecidability has impact on REAL life applications/examples? I understand that it can be used for implementation of various algorithms but what else?
|
In Harvard CS 221 Computational Complexity, Lecture 3, it introduced Branching Programs
A branching program is a DAG that
has 1 start node and 2 output nodes with out-degree 0, labelled 0 and 1. Each non-output
node is labeled with one of x1, x2, . . . , xn and each node has 2 outgoing edges labeled 0 and 1
For examp... |
Is there a way where sort turns a non regular language into a regular one.
What I mean by sort is this:
Consider the language $L =$ { $bac, cbca, acbb$}. $sort(L) = $ {$abc, abcc, abbc$} respectively.
If there is, do you have an example. If not can you provide a proof if you can.
|
The start state cannot have any "in edge" (an arrow point directly to the start state) and only out edge is possible for the start state. Other states except the start state are free of limit in DFA (deterministic finite automaton).
I have doubt between two awnsers which are:
It depends on the language and is not poss... |
The following approximation algorithm for the Minimal Dominating Set Problem is said by a fellow student to be a 1.5-approximation:
Start with empty set $S$
As long as not all vertices are covered:
Add a vertex that is not in $S$
with the most uncovered neighbors including itself.
Mark it and all its neighbors as cov... |
Here is the problem statement. Let $E_1,...,E_n$ be a set of $n$ exercises, each taking 1 day to solve, and suppose we have $n$ days available to solve the exercises. Each exercise $E_i$ has a deadline $D[i]$ associated to it, which is an integer in the range $0...n - 1$. Each exercise $E_i$ must either be solved on a ... |
Here is the problem. Suppose you have to drive from Eindhoven to the south of France. Your start and destination are fixed and the route is fixed as well. You start with a full petrol tank, but since the distance is quite long you will need to fill up your tank several times. There are $n$ petrol stations along the way... |
I am learning about Turing machines. I understand the alphabet set of symbols and the states a machine can be in. However, I do not understand how the transition function works.
I come from a maths background and functions always follow a simple input output. The table of transtions seems out of place.
How does a compu... |
In the Chomsky hierarchy what is corresponding to a contracting grammar?
I can find references to non-contracting grammars (which can be transformed into context-sensitive grammars accordingly to what Wikipedia is saying: https://en.wikipedia.org/wiki/Noncontracting_grammar), but I don't know what would correspond to a... |
excuse me, could someone explain to me the reduction of the problem 3-dimensional matching to subset sum? I was reading Jon Kleinberg's design algorithms book and when I came across this reduction I didn't understand how it really works:
"So consider an instance of 3-Dimensional Matching specified by sets $X,Y,Z$, eac... |
Is it correct to assume that if the input that I hash is sensitive, that I should also consider the locality-sensitive hash generated for that input to be sensitive? I presume that, if an attacker has access to all the hashes and a couple known plaintexts, then they could likely use those to make a cryptanalysis attack... |
We know that finding the size of the maximal independent set of a planar graph is NP-complete. I'm curious about whether it remains NP-complete for maximal planar graphs, i.e., the graphs in which adding any edge will destroy its planarity, or equivalently, all edges of whose faces are bounded by three edges.
I've aske... |
The below text is taken from the book : Operating Systems: Internals and Design Principles by William Stallings, 8th edition, page 68.
Scheduling and Resource Management
A key responsibility of the OS is to manage the various resources
available to it (main memory space, I/O devices, processors) and to
schedule their ... |
How do you calculate the amount of iterations the following loop will have in terms of n?:
for (i = 1; i < n^3; i += n) {
}
I've gotten as far as: $$i=(x-1)n+1\ for\ current\ iteration=x$$ $$Total\ iterations=x\ when\ n(x-1)+1\geq n^3>n(x-2)+1$$
|
few weeks ago I had an exam in automata theory course and I've been asked to write the following non-deterministic finite automata
Write a NFA which accepts the following language - the language contains all the words (above {a, b, c}) with at least 1 appearance of the letter c, or the parity of the count of the lette... |
Consider Merge-sort algorithm that we modify as follow:
Suppose we extend it to divide the input array into $m$ not necessary equal and after sorting each of them, merge them. Now can we conclude that the running time will be $O(n\log n)$?
I think the running time should be $O(n^2)$ as follow:
If the algorithm divide t... |
If a function f has a while loop or for loop, can I compile this function into an acyclic boolean circuit that ensures that each gate is topologically ordered, i.e. there is no feedback? If so, how exactly is that done, by loop expansion? And if compiling the function as a cyclic boolean circuit is allowed, does it sim... |
Problem is "Constructing a DFA accepting set of all strings whose 10th symbol from the right end is $1$ over $\{0,1\}$"
The NFA is easy
$$(0+1)^*1(0+1)^9$$
but DFA has to have minimum $2^{10}$ states.
I've tried to see the pattern by constructing 2nd and 3rd symbol from the right.
I mean, when it is the 2nd from the ri... |
In many academic papers algorithms are described. They seem to use similar "syntax".
Is there a standard for this language? If I want to describe an algorithm, would I improvise my description?
For example, note that papers in general use
a <-- b
to assign a, not a = b. But where is that standard?
|
Is there an algorithm to multiply two polynomials with coefficients in the max-plus semiring $(\mathbb{Z}\cup\{-\infty\}, \max, +)$ which is faster than the trivial one? I'm interested in the coefficients of the product, so I can't ignore the differences between two polynomials which specify the same function. This mak... |
So the problem is: There is a group of n people that want to meet each other and everyone is divided into pairs, so everyone has a partner that they know. Now there will be parties at which they can get to know each other. At every party there can be as many round tables as needed, at which people can sit. When they si... |
Given the following code:
void aux(int n){
while (n > 0) {
printf("%d", n);
n--;
}
}
long f1(int n)
{
long sum = 0;
for (int i = 1; i * i <= n; i++) {
for (int j = 1; j <= i; j++) {
aux(i * j);
sum += i * j;
}
}
return sum;
}
I have calculated the time complexity of aux and I fou... |
I have several lines that are shown in different colours, do not know which are connected to each other in advance. I want to do path planning only using these lines, i.e., route planning. If I am able to construct a graph using these line segments, I can use graph search techniques, e.g., A*, to find the path between... |
From this link Does $NP^{NP}=NP$?
I learned that if $NP^{NP} = NP$, then the polynomial hierarchy collapses to it's first level.
But how to prove it？
|
I had an assignment in which I had to design a pushdown automata that recognizes the language ${w \in [a,b,c]^*|w }$ have the same number of "ab" and "ba".
Tried to make a pushdown automata that if reads first ab pushes 1 to the stack and then if finds "ba" then pops it (and again reads "ab" and then "ba" , push / pop ... |
This seems like it should be a "textbook"/standard problem but I wasn't able to find anything about it, so I'd like to know if anyone else has seen something like it before or can suggest more keywords I could search for / perspectives I could view it from:
Informal problem statement
Informally, the situation is that w... |
Given a multivariate polynomial of degree 4 on $v$ (real) variables such that there are $N$ terms in the polynomial. Is there an efficient algorithm to verify if it has a solution?
Not aware of any algorithm for this problem. Can someone please comment.
I think the solution itself can be calculated by Newton Raphson al... |
I want to generate a set of X int numbers, were 4 <= X <= 100, both positive and negative that add up to target value.
The numbers are between -6 and 4 and there needs to be at least 2 negative numbers, and up to half of the numbers can be negative.
I have seen posts about this being done for all positive numbers but I... |
I have found multiple definitions of what a heuristic is, and I have found multiple computer science-related definitions.
In my university course, the lectures cite the Nielson Norman Group defining a heuristic as an area of measurement. On Wikipedia, a heuristic is defined as a problem-solving technique. These definit... |
Like this person on Google Groups, I'm trying to understand how to write a grammar involving Wolfram Language's low-precedence unary & operator.
The operator works like this:
g[#, #^2] & /@ {x, y, z}
The g[#, #^2] & part builds an anonymous function # -> g[#, #^2], and then /@ maps it over the list {x, y, z}.
However,... |
I am trying to research handling a specific type of possible subgraph in directed acyclic graphs.
However, I am struggling to find the correct term to use.
If we consider the subgraph S to be in a DAG G. Where S is made up of 2 paths, starting at a common node and ending at a common node. Thus forming a "diamond" shape... |
Placed exactly the code and the explanation of the book : Introduction to Algorithms Third Edition
In order to move subtrees around within the binary search tree, we
define a subroutine TRANSPLANT, which replaces one subtree as a child
of its parent with another subtree. When TRANSPLANT replaces the
subtree rooted at ... |
I have a homework assignment that requires me to create CFG $G$ for
$$L = \{a^i b^{i+j+k} c^j d^k\}$$
so that it can accept words like ab, aaabbbbd, abbbcd, but it should not accept abba, aabbbbbc, or abc since the number of b must be the number of a+c+d.
I need CFG of L(G)
I tried using chatgpt but the answers are no... |
I'm learning about strict functions in Haskell.
A function f is strict if f ⊥ = ⊥
Some functions are strict only in the first argument (for e.g. const), others are strict in the second (for e.g. map).
I'm trying to think of a function which is strict in only both arguments at the same time, so
f x ⊥ is not bottom
f ⊥ ... |
Consider the following nonrigorous argument that $P \neq NP$ implies $avgP \neq distNP$. (For those unfamiliar with the latter complexity classes, they deal with average case hardness.)
Suppose A is the algorithm that solves some NP complete problem (say 3-SAT) with the fastest average case complexity possible and supp... |
Consider
$$\begin{align} T(n^3)&=T((n-1)^3)+n\\
T(1)&=1
\end{align}$$
According to the substitution method, $T(n^3)=O(n^2)$ (please if I wrong, correct me). Now, what is the answer of $T(n)$? I think $T(n)=O(1)$ but the answer of my teacher is $T(n)=O(n^\frac{2}{3})$.
|
The problem $⊕2SAT$ is defined as a problem where we need to find the parity of the number of solutions of $2$-$CNF$ formulae and is known to be $\oplus P$ complete.
I introduce the following variant of $⊕2SAT$:
In this variant we put the restriction on the input of the $⊕2SAT$ problem the restriction is that every in... |
It is my understanding, based on this question that problems solved on quantum computers with oracles don’t make any statements about BQP in relation to other complexity classes.
The fallacy is in the construction of the algorithm. It uses an oracle. That oracle computes something using the function in a very specific... |
I am told that if a decision problem that is in NP Complete can be solved in polynomial time, then P=NP. However, would this mean that we would instantly have an algorithm to solve any NP problem. Like if someone solved the traveling salesman problem, would that mean that we would instantly have an algorithm to factor ... |
This is like a follow up question from my previous post about complexity of $positive -⊕2SAT$.
The problem positive $⊕2SAT$ is defined as a problem where we need to find the parity of the number of solutions of positive $2$-$CNF$ formulae and is known to be $\oplus P$ complete.
I introduce the following variant of $⊕2S... |
The famous PPAD class revolves around the End-Of-The-Line problem. Basically, it states that you are given two polynomial depth circuits, $P$ and $Q$, which act as "possible previous" and "possible next" functions, each with an exponentially sized domain. And the task is to find an input that satisfies $P(Q(x)) \neq Q(... |
Suppose we have $n$ intervals given in the form of (startTime,EndTime). I wish to calculate maximum length of the region that is exactly union of $1<=k<=n$ intervals.
Note that there are 2 cases for which I am trying to find an algorithm individually
Union of selected intervals might not be a single interval
Union of ... |
Many problems in computer science input boolean circuits to problems.
Just as a toy example, let's define the below problem to be called $A$:
Given a polynomial depth circuit with $N$ bits of output, C, does there exist an input $x$ such that $C(x) = 0$?
Is it correct to say that an equivalent problem, on a quantum c... |
I want to reversibly transcode arbitrary information (a digital signature), initially $n$ bits, into symbols in an alphabet with $s$ symbols, with little space loss. In my application‡ $s=45$. Thus I can e.g. transcode $n=192$ bits into $m=\lceil n/\log_2s\rceil=\lceil34.961\ldots\rceil=35$ symbols with less than $0.12... |
I need an algorithm that can do facial recognition in a video based on a training set. For any faces detected, it should give an output as how much the face matches with the faces in the training set. How can this be done ?
|
I am trying to solve the Longest Increasing Subsequence(LIS) Problem using different OPT Function than the one which normally used. I have been given this question as an extra credit and I have been trying to wrap my head around the different OPT Functions and the recurrence relation possible. The solutions I found alw... |
I know the basics about base64 encoding, but thinking about it abstractly I have a theoretical question.
If we consider base64 a mathematical function(in our case computable), Does there exists an invariant for base64-encoding function ? It only make sense or to narrow down the scope of the question I assume input bina... |
I am currently learning about NP and coNP related content and have been exposed to the$NP \overset{\text{?}}{=}coNP$ problem.
I would like to know what are the directions to work on if I want to prove that $NP=coNP$? For example, currently I know that if I can prove that a coNP-complete language belongs to NP, then I c... |
I have so show that, for the normal 9x9 sudoku, determining whether there is a solution is just as hard as computing a solution if it exists. I should do that by assuming i have a polynomial-time algorithm for checking whether a given sudoku is solvable and i then should explain how to obtain a polynomial-time algorith... |
We defined a polynomial-time verifier so that it has certificates of length AT MOST p(|x|) for some fixed polynomial p.
Why does it not make a difference to require a certificate $c$ to have EXACLTY length p(|x|)?
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.