OpenAlex
PricingAboutJobs
Log inGet started
Work

Exponential lower bounds for semantic resolution

HTML

Year: 1997
Type: book-chapter
Source: DIMACS series in discrete mathematics and theoretical computer science
Parent work: Proof Complexity and Feasible Arithmetics
DOI: 10.1090/dimacs/039/10
Author: Stasys Jukna
Language: English

Topic: Complexity and Algorithms in Graphs
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Keywords: semantic resolution, exponential lower bounds, proof complexity, resolution proof systems, propositional logic, proof search

Open Access status: closed
OpenAlex ID: W19485686
FWCI: 0.859
Cites:
Cited by: 8
Related to: 10
OpenAlex
Nonprofit
Open DataOpen Data
Open Source
Product
Search
Compare
Pricing
Repositories
Unpaywall
Unsub
Developers
API docs
Data snapshot
Status
Source code
Organization
About
Team
Testimonials
Brand
Jobs
Community
Help center
Contact
Events
Blog
Mailing list
Supporters
Legal
Privacy
Accessibility
Terms