Research
Home
Browse Papers
Researchers
Subscriber
Free Tools
Submit Paper
Login
Register
Research
Papers
Researchers
Subscribers
Tools
Submit Paper
Research
Computer Science
PDF Available
Non-peer-reviewed Preprint
Nested satisfiability
Donald E. Knuth
·
Published 1990-01-01
Expertini
/
Research
/
Computer Science
/
Nested satisfiability
📄 Download PDF
🔖 Bookmark Paper
Share:
Abstract
A special case of the satisfiability problem, in which the clauses have a hierarchical structure, is shown to be solvable in linear time, assuming that the clauses have been represented in a convenient way.
Keywords
Computer Science
📄 Full Paper Available as PDF
This paper is available as a downloadable PDF.
📄 Download PDF
✨ AI Plain-English Summary
Get a plain-English summary of this paper generated by AI (5 free per day).
Generate Summary
Comments (0)
No comments yet. Be the first to comment.
Login to Comment
Related Papers
Computer Science
PDF
A Model for Web Page Usage Mining Based on Segmentation
2012
Computer Science
PDF
Core-Periphery Structure in Networks
2012
Computer Science
PDF
Risk Assessment Techniques and Survey Method for COTS Components
2012
Computer Science
PDF
Multi-Scale Matrix Sampling and Sublinear-Time PageRank Computation
2012
Subscriber Register
or
Subscriber
Researcher
Full Name*
Email Address*
Institution / University
Please leave this field blank
Password*
8+ characters, with uppercase, number & special character.
Confirm Password*
You are successfully registered.
Register
Already have an account? Login Now
Subscriber Login
or
Subscriber
Researcher
Email
Password
You have successfully logged in.
Remember me
Forgot password?
Log In
Don't have an account? Create Now
Reset Password
Email
Password Reset email successfully sent.
Reset Password
This will send a password reset link to your registered email address.
✕
Research
