Newest Questions

-1 votes
0 answers
1 view

tournament tree algorithm for n>= 3 bounded waiting property

I'm looking to solve the following question in the attached picture but not sure on how to approach it, my initial guess is to refute the claim as a process on losing on multiple levels and allow ...
Saleh 's user avatar
0 votes
0 answers
3 views

On satisfiable/unsatisfiable 2SAT formulas under some restriction

Let $\mathcal C(2,k)$ be set of satisfiable $2SAT$ formulas in $\leq k$ variables where for any two variables $x$ and $y$, out of the four clauses a. $x\vee y$ b. $\neg x\vee y$ c. $x\vee\neg y$ d. $\...
Turbo's user avatar
  • 2,937
1 vote
0 answers
8 views

Self-referential text string compression

Can a text string contain a lossless compression of itself as a substring? I asked Gemini free, which wasn't sure but thought the answer is 'no', and ChatGPT free, which claimed it is 'no' except in ...
user182134's user avatar
3 votes
1 answer
13 views

How can I think about one statement that $TM_1$ uses $TM_2$ to compute $TM_3$?

In title, $TM_1$, $TM_2$ and $TM_3$ are all turing machines. In book Computational Complexity: A Modern Approach by Sanjeev Arora et al, the proof of the non-computability of the HALTING problem is ...
JohnsonL's user avatar
0 votes
0 answers
5 views

Knuth-Bendix completion as a context-sensitive grammar

I was wondering if the following is correct and looking for advice on how to develop it. This was motivated by wondering how many distinct monoids of order 3 there exist up to isomorphism. I ...
Julius Hamilton's user avatar
0 votes
0 answers
9 views

How to transfer Hamilton cycle problem in non-directed graph to zero-one equation?

There are many discussions showing how to reduce Zero-One Equation problem to Hamilton cycle problem in a non-directed graph. However, none of these shows opposite transferring. I need to find a ...
leonxia80's user avatar
1 vote
0 answers
14 views

Two pseudo-perfect bipartite matchings

Given is a bipartite graph $G=(A,B;E)$ with $|B| = 2|A|$. Suppose we want to decide whether $B$ can be partitioned into two equal-size parts $B_1,B_2$ such that there is a perfect matching between $A$ ...
tarthoe's user avatar
  • 133
0 votes
1 answer
29 views

What's the time complexity of splitting an array into 2 equal halfs?

In $O(n)$ time, we can do easily. I am asking because accessing an Index in an array takes $O(1)$ time irrespective of size of the array. So, is there an way of doing this in $O(1)$ time?
kernel's user avatar
  • 138
-1 votes
0 answers
17 views

Was computing technology advanced enough to achieve a nearly fully automated economy in the mid-20th century? [closed]

I came across a very interesting Reddit post from a Redditor who claimed that he had worked as a software engineer for nearly 20 years. He said the following about the world's capacity to fully ...
Jude Zambarakji's user avatar
-1 votes
0 answers
24 views

Gödel sentences for Turing machines

Gödel's first incompleteness theorem states that any consistent, sufficiently expressive formal system of arithmetic on the natural numbers (one capable of performing both addition and multiplication) ...
Barney's user avatar
  • 209
2 votes
0 answers
43 views

What algorithm can be used to implement code folding for the C programming language?

I'm working on a simple editor for the C programming language (without using an AST), and I need to implement a code folding feature. When the user opens a file, an initial parse is performed, and all ...
SilverCube's user avatar
0 votes
0 answers
16 views

Seeing AM and MA in terms of "overwhelming majority" quantifier

The lecture notes here [1,2], mention the characterization of the complexity classes $AM$ and $MA$ in terms of quantfiers. More precisely, one can define a quantifier class $\exists\circ BP$ as $L \...
advocateofnone's user avatar
1 vote
0 answers
32 views
+50

Basic question about parallel repetition in IP protocol

The book Sanjeev Arora and Barak defines class IP (interactive protocol) by making the verifier have private coins. Before proceeding to public coin proofs and showing they are the "same," ...
advocateofnone's user avatar
1 vote
0 answers
43 views

Has a Torus data structure been constructed?

It would be comprised of elements similar to a linked list. The elements would look something like: ...
Mr X's user avatar
  • 111
-4 votes
0 answers
25 views

An algorithm for solving the maximum clique problem [closed]

I found a polynomial algorithm to solve maximum clique problem. Please check the results.
leonxia80's user avatar

15 30 50 per page
1
2 3 4 5
3319