4. Computer Science
  5. Computational Complexity

Fredrik Kuivinen

Computer Science – Computational Complexity

Scientist

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

Details

Scientist

Approximability of Bounded Occurrence Max Ones

Computer Science – Computational Complexity
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Approximability of Integer Programming with Generalised Constraints

Computer Science – Computational Complexity
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Hard constraint satisfaction problems have hard gaps at location 1

Computer Science – Computational Complexity
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Min CSP on Four Elements: Moving Beyond Submodularity

Computer Science – Computational Complexity
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

On the Complexity of Submodular Function Minimisation on Diamonds

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

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

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

Rate now

     

Profile ID: LFWR-SCP-P-90431

  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