4. Computer Science
  5. Computational Complexity

Charles Sauerbier

Computer Science – Computational Complexity

Scientist

Rate now
  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Scientist

A Polynomial Diophantine Generator Function for Integer Residuals

Computer Science – Discrete Mathematics
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

A polynomial time (heuristic) SAT algorithm

Computer Science – Computational Complexity
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Computing a Discrete Logarithm in O(n^3)

Computer Science – Data Structures and Algorithms
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Computing a Frobenius Coin Problem decision problem in O(n^2)

Computer Science – Data Structures and Algorithms
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Computing an Integer Prime Factoring in O(n^2.5)

Computer Science – Data Structures and Algorithms
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Charles Sauerbier does not yet have a rating. At this time, there are no reviews or comments for this scientist.

If you have personal experience with Charles Sauerbier, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Charles Sauerbier will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-P-258052

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.

Canada

 Charities
 Companies
 MP Candidates
 Patents
 Employee Salary Disclosure

World

 Places of the World
 Scientific Papers

United States

 Banks
 Companies
 Counties
 Patents
 Employee Salary Disclosure