Amanote Research

Amanote Research

  • Register
  • Sign In

Resolution Lower Bounds for Perfect Matching Principles

doi 10.1109/ccc.2002.1004336

Full Text

Abstract

Available in

Date

Unknown

Authors

A.A. Razborov

Publisher

IEEE Comput. Soc


Related search

Improved Techniques for Lower Bounds for Odd Perfect Numbers

Mathematics of Computation
Computational MathematicsApplied MathematicsNumber TheoryAlgebra
1991English

Input Distance and Lower Bounds for Propositional Resolution Proof Length

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2005English

Improved Lower Bounds for Tree-Like Resolution Over Linear Inequalities

English

Lower Bounds for the Weak Pigeonhole Principle and Random Formulas Beyond Resolution

Information and Computation
Theoretical Computer ScienceComputational TheoryComputer Science ApplicationsInformation SystemsMathematics
2002English

Lower Bounds

2016English

Lower Bounds for Subgraph Isomorphism

2019English

Capacitive-Loaded Interstitial Antenna for Perfect Matching

Electronics Letters
Electronic EngineeringElectrical
2003English

Lower Bounds for Z-Numbers

Mathematics of Computation
Computational MathematicsApplied MathematicsNumber TheoryAlgebra
2009English

Lower Bounds for Dynamic Connectivity

2004English

Amanote Research

Note-taking for researchers

Follow Amanote


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

Privacy PolicyRefund Policy