Improved Lower Bounds for Tree-Like Resolution over Linear Inequalities

Kojevnikov, Arist

doi:10.1007/978-3-540-72788-0_10

Local TagsRelease HistoryDetailsSummary

Improved Lower Bounds for Tree-Like Resolution over Linear Inequalities

Kojevnikov, A. (2007). Improved Lower Bounds for Tree-Like Resolution over Linear Inequalities. In Theory and Applications of Satisfiability Testing – SAT 2007: proceedings (pp. 70-79). Heidelberg [et al.]: Springer.

Item is Released

show all

Basic

hide

Item Permalink: https://hdl.handle.net/21.11116/0000-0004-2B6F-1 Version Permalink: https://hdl.handle.net/21.11116/0000-0004-2B70-E

Genre: Conference Paper

Files

show Files

Locators

show

Creators

hide

Creators:
Kojevnikov, Arist¹, Author

Affiliations:
1Max Planck Institute for Mathematics, Max Planck Society, ou_3029201

Content

show

Details

hide

Language(s): eng - English

Dates: Date issued: 2007

Publication Status: Issued

Pages: -

Publishing info: -

Table of Contents: -

Rev. Type: Peer

Identifiers: eDoc: 351330
DOI: 10.1007/978-3-540-72788-0_10

Degree: -

Event

hide

Title: Theory and Applications of Satisfiability Testing – SAT 2007: 10th International Conference

Place of Event: Lisbon

Start-/End Date: 2007-05-28 - 2007-05-31

Legal Case

show

Project information

show

Source 1

hide

Title: Theory and Applications of Satisfiability Testing – SAT 2007: proceedings

Source Genre: Proceedings

Creator(s):

Affiliations:

Publ. Info: Heidelberg [et al.] : Springer

Pages: - Volume / Issue: - Sequence Number: - Start / End Page: 70 - 79 Identifier: -

Source 2

hide

Title: Lecture notes in computer science

Source Genre: Series

Creator(s):

Affiliations:

Publ. Info: -

Pages: - Volume / Issue: 4501 Sequence Number: - Start / End Page: - Identifier: -