4. Computer Science
  5. Computational Complexity

A. G. Yaneff

Computer Science – Computational Complexity

Scientist

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

Details

Scientist

How long is a Proof? - A short note

Computer Science – Computational Complexity
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Remarks on d-Dimensional TSP Optimal Tour Length Behaviour

Computer Science – Computational Geometry
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Solution Bounds for a Hypothetical Polynomial Time Aproximation Algorithm for the TSP

Computer Science – Computational Complexity
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

A. G. Yaneff does not yet have a rating. At this time, there are no reviews or comments for this scientist.

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

Rate now

     

Profile ID: LFWR-SCP-P-216949

  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