Newest Questions

Filter by
Sorted by
Tagged with
0 votes
1 answer
7 views

I'm having trouble understanding what one step in a local search really means. In the course I'm taking, there was this old exam question: "Describe what happens in one step in a local search ...
0 votes
0 answers
10 views

I am doing an excercise in the book Type Theory and Formal Proofs. In 3.31 a, we are provided with a definition of natural number addition: $$ \text{add} \equiv \lambda m, n : \texttt{nat}. \lambda \...
1 vote
1 answer
168 views

Given an undirected graph $G$ and an edge $e,ドル I want to know if there is an odd cycle that goes through $e$. Does an algorithm exist that solves such a problem in polynomial time?
0 votes
0 answers
15 views

I am reading Section 1.8 ("War Story: Psychic Modeling") from Skiena’s The Algorithm Design Manual and am confused about the role and interpretation of the parameter j in the initial (nave) set-cover ...
0 votes
0 answers
11 views

I would like to use machine learning or some kind of algorithm to find optimal solutions to the 2D packing problem (the arrangement of N unit shapes into another shape that results in the smallest ...
1 vote
1 answer
35 views

I’m reading Skiena's Algorithm Design Manual 3rd edition, specifically the "Stop and Think: Greedy Movie Stars?" counterexample (Figure 1.7). The greedy heuristic considered is: repeatedly pick the ...
1 vote
1 answer
50 views

I would like to understand the structure of sequences whose consecutive XOR values increase strictly. The problem is as follows. Let integers $(l,r)$ be given with 1ドル\le l\le r$. Consider all finite ...
1 vote
0 answers
54 views

I am currently looking into Berman-Hartmanis Conjecture. [Paper 1, Wiki] In the abstract of Paper 1, it is mentioned that all the known problems are p-isomorphic. (Paper was published in 1975.) The ...
0 votes
1 answer
56 views

Im trying to prove that in a simple undirected graph with: |V|=n, |E|=kn for a natural k there exists a cycle of length at least k but im stuck. So far ive figure that for an undirected graph a DFS ...
1 vote
0 answers
55 views

I have recently been investigating Turing-Complete systems and discovered something called "Cyclic Tag". It is relatively simple to explain, it involves transforming an initial binary string through ...
-2 votes
0 answers
58 views

In modern IT industry, we often think in terms of infrastructure stacks, arranged from the most fundamental physical layer to the highest level of logical abstraction. At the bottom, you have multi ...
1 vote
1 answer
209 views

Is the language {xyx, where x,y are arbitrary strings over {0,1}} a regular set? I'm not sure on this, but I think it is regular. Let $x=\epsilon$ then $xyx=y$ and $y=\{0,1\}^*$.
0 votes
1 answer
32 views

Context I am working through Type Theory and Formal Proof (Nederpelt). Chapter 8 introduced the idea of formal definitions, and Chapter 9 started to extend the lambda calculus to include them, λD. ...
0 votes
1 answer
38 views

Given arbitrarily large (but not infinite) memory is it possible to compute and store every possible output for every possible input beforehand thus making the program run in constant time?
0 votes
1 answer
33 views

I'm learning algorithms, and I'm unsure of the height of the binary tree, which is one of the sequence operations of the binary tree. Can anyone explain what's height of the binary tree is and how we ...

15 30 50 per page
1
2 3 4 5
...
3338