4. Computer Science
  5. Computational Complexity

Per Austrin

Computer Science – Computational Complexity

Scientist

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

Details

Scientist

A new point of NP-hardness for 2-to-1 Label Cover

Computer Science – Computational Complexity
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

A Simple Deterministic Reduction for the Gap Minimum Distance of Code Problem

Computer Science – Computational Complexity
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Approximation Resistant Predicates From Pairwise Independence

Computer Science – Computational Complexity
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Improved Inapproximability For Submodular Maximization

Computer Science – Computational Complexity
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Inapproximability of NP-Complete Variants of Nash Equilibrium

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

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

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

Rate now

     

Profile ID: LFWR-SCP-P-180741

  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