Newest Questions
50,044 questions
- Bountied 0
- Unanswered
- Frequent
- Score
- Trending
- Week
- Month
- Unanswered (my tags)
0
votes
0
answers
4
views
Experimental Tools to Test-Edit languages. 'example: add keywords to Javascript'
On the objective and interest of experimenting with 'altering Javascript' and/or 'Creating your own language' -- With a test-kit coders could edit js in the sense of 'making their own keywords'
My ...
0
votes
1
answer
18
views
Cache Mapping Question
My question is, how can I get the line number just by dividing the number by the cache line size(64)?
For example, let's take 510,
510 in binary is 000000000(00111)111110 , so 00111 is show the line ...
0
votes
3
answers
465
views
If a literal like 0.45 has exact decimal precision, why can’t compilers preserve that and avoid floating-point rounding issues?
In most languages, writing a floating-point literal like 0.45 produces a binary IEEE-754 double that is actually stored as something slightly less than 0.45 (e.g., 0.44999999999999996). Because of ...
1
vote
1
answer
20
views
What's an example of a problem that is in Psearch, but not in NPsearch?
I was told during a lecture that there exist computational problems that are within $\text{P}_\text{search}$ but are not in $\text{NP}_\text{search}$ this seems impossible to me because I feel like a ...
0
votes
0
answers
23
views
j-th smallest element in a min heap
Consider a min-heap that is constructed by the keys $\{1,2,3,...,n\}$ where $n=2^{k}-1$ for some $k>1$ not necessarily in the same order. Then I first showed that $j$-th minimum element cannot ...
1
vote
0
answers
18
views
Good algorithm to solve a system of "cyclic" banded linear equations
I would like to solve the equation $Ax=b$ where $A$ is an $N\times N$ "cyclic" banded matrix (there might be a better term, but I wasn't able to find it), i.e. a matrix that look like
$$\...
2
votes
0
answers
42
views
Find all non-extendable ranges in an array of real values with a non-positive sum
I have a long array of size $n>10^6,ドル call it $X$. I would like to find all ranges $[a, b)$ satisfying the following conditions
$\sum_{i=a}^{b-1}X[i] \leq 0,ドル
$b-a \geq K,ドル
$\sum_{i=a-1}^{b-1} X[i]...
1
vote
0
answers
40
views
Is there an efficient algorithm to reduce the degree of a multivariate polynomial given a list of monomial substitutions?
The degree of an $n$-variate polynomial is defined as the maximum degree of the monomials that composes it. Now, given a polynomial $P$ (or rather, a list of monomials, since the coefficients don't ...
3
votes
1
answer
115
views
Understanding the ⊢ notation and context in Natural Deduction vs Sequent Calculus
I'm trying to understand how to interpret the turnstile notation Γ ⊢ A when it appears in natural deduction systems, and I'm confused about the relationship between natural deduction and sequent ...
-1
votes
0
answers
28
views
A problem from CESE that I can't find solution [closed]
https://cses.fi/problemset/task/3401
or
https://vjudge.net/problem/CSES-3401
please help me to solve it,
you can told me the solution or the link to the tutorial.
you can also send your opinion to my ...
0
votes
0
answers
14
views
derivation of $\mathsf{coNL} = \mathsf{NL}$ from $\overline{\mathtt{PATH}} \in \mathsf{NL}$ (Immerman-Szelepscényi theorem)
In Arora and Barak's book "Computational Complexity: A Modern Approach" (see draft pdf here https://theory.cs.princeton.edu/complexity/book.pdf), the $\mathtt{PATH}$ problem is given as the ...
-2
votes
0
answers
13
views
How do I create logical MBR partitions programatically?
I need to create 3 primary partitions, 1 extended which will contain 2 logical partitions. I see that I have to give PartitionNumber as 0 for the extended partition and then PartitionNumber 4 and 5 ...
0
votes
0
answers
34
views
How is it possible to implement a zero-address instructions Von Neumann CPU?
The idea is to combine these two principles together.
If we use zero-address instructions in a CPU, this implies having a stack memory. However, the idea of Von Neumann architecture is to store both ...
1
vote
0
answers
23
views
Hardness of approximation for max-LINSAT mentioned in DQI paper
I went through Def 2.1 of this paper, where the approximation version of max-LINSAT is defined as follows.
Let $\mathbb{F}_p$ be a finite field.
Input: For each $i=1,\cdots,m,ドル let $F_i\subset \...
0
votes
0
answers
21
views
Questions about decidability and streaming algorithm
I was working on some conceptual parts about the Turing Machine and streaming algorithm, and got a bit stuck. Below is the statement I am trying to prove.
"If L has a streaming algorithm, then L is ...