Samuel Kohn

I have 20 years of experience teaching quantitative analysis, mathematics, operations, management, finance, and marketing information systems at graduate and undergraduate levels. The teaching experience includes synchronous (face-to-face) and asynchronous (online) teaching methods.

In addition, I have over 20 years of experience in the telecommunication and banking industries, with assignments in business development, international finance, marketing, and strategic planning. I have a PhD in mathematics and an MS in history and have done classical algorithmic work on the Hamiltonian "Traveling salesman" problem and NP vs. P problems using classical and quantum algorithm approaches.

NP vs. P Cosine Problem

There is a connection between the "Hamiltonian Network Problem" and the following problem:

An n-oracle knows the value for any value, t, of a secret function of the form: cosSeries n (t) = a0 + a1 Cos (t) +...+ an Cos (n t)

• The secret is the value of the ais.
• The value of n is not a secret.

You ask the n-oracle the value of the secret function for specific values of t > 0.

• You provide the oracle with a value of t.
• The n-oracle spits out the value of the secret function for that value of t.

The problem is to find out if a0 is 0 or not by asking the n-oracle as few questions as possible.

Rule 505053