4. Computer Science
  5. Computational Complexity

Nathan Segerlind

Computer Science – Computational Complexity

Scientist

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

Details

Scientist

Constant-Depth Frege Systems with Counting Axioms Polynomially Simulate Nullstellensatz Refutations

Computer Science – Computational Complexity
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Nearly-Exponential Size Lower Bounds for Symbolic Quantifier Elimination Algorithms and OBDD-Based Proofs of Unsatisfiability

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

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

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

Rate now

     

Profile ID: LFWR-SCP-P-374144

  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