A note about k -DNF resolution

Published 2018 View Full Article

  1. Home
  2. Publications
  3. Publication Search
  4. Publication Details
Title
A note about k -DNF resolution
Authors
Keywords
Theory of computation, Proof complexity, k, -DNF, Resolution
Journal
INFORMATION PROCESSING LETTERS
Volume 137, Issue -, Pages 33-39
Publisher
Elsevier BV
Online
2018-04-27
DOI
10.1016/j.ipl.2018.04.014

Ask authors/readers for more resources

Protocol

Community support

Reagent

Community support

Reprint

Contact the author

Discover Peeref hubs

Discuss science. Find collaborators. Network.

Join a conversation

Create your own webinar

Interested in hosting your own webinar? Check the schedule and propose your idea to the Peeref Content Team.

Create Now
Webinars Posters Questions Hubs Funding Journals Articles Connect Collections Reviewers About Us FAQs Mobile App Privacy Policy Terms of Use
© Peeref 2019-2024. All rights reserved.