Skip to main content

Unanswered Questions

2 questions with no upvoted or accepted answers
12 votes
0 answers
274 views

NP-complete reduction: (grid-)Hamiltonian circuit

Background Hamiltonian circuit problem is a decision problem which asks whether a given graph has a Hamiltonian circuit, i.e. a cycle that visits every vertex exactly once. This problem is one of the ...
0 votes
2 answers
243 views

minimum line queries in logarithmic time

Input You are given 2 positive integers, n, q, followed by q queries. the queries can be of two forms: 0 a b: add the line a*x + b. a and b are integers between -...