Amanote Research

Amanote Research

    RegisterSign In

Improved Lower Bounds for Tree-Like Resolution Over Linear Inequalities

doi 10.1007/978-3-540-72788-0_10
Full Text
Open PDF
Abstract

Available in full text

Date

Unknown

Authors
Arist Kojevnikov
Publisher

Springer Berlin Heidelberg


Related search

Lower Bounds for the Linear Complexity of Sequences Over Residue Rings

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1991English

Exponential Lower Bounds and Integrality Gaps for Tree-Like Lovász-Schrijver Procedures

2009English

Lower Bounds for Solutions of Hyperbolic Inequalities

Proceedings of the American Mathematical Society
MathematicsApplied Mathematics
1965English

Improved Lower Bounds for Multicovering Codes

IEEE Transactions on Information Theory
Computer Science ApplicationsInformation SystemsLibraryInformation Sciences
1999English

Resolution Lower Bounds for Perfect Matching Principles

English

Effective Lower Bounds for Some Linear Forms

Transactions of the American Mathematical Society
MathematicsApplied Mathematics
1976English

Improved Techniques for Lower Bounds for Odd Perfect Numbers

Mathematics of Computation
Computational MathematicsApplied MathematicsNumber TheoryAlgebra
1991English

Efficient Algorithms and Lower Bounds for Robust Linear Regression

2019English

Isoperimetric Inequalities for Finite Perimeter Sets Under Lower Ricci Curvature Bounds

Atti della Accademia Nazionale dei Lincei, Classe di Scienze Fisiche, Matematiche e Naturali, Rendiconti Lincei Matematica E Applicazioni
Mathematics
2018English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2025 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy