Read-Once Branching Programs, Rectangular Proofs of the Pigeonhole Principle and the Transversal Calculus

Combinatorica - Germany
doi 10.1007/s00493-002-0007-7
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Science and Business Media LLC

Related search

Read-Once Branching Programs, Rectangular Proofs of the Pigeonhole Principle and the Transversal Calculus

1997English

Exponential Lower Bounds for the Pigeonhole Principle

1992English

On the Nonapproximability of Boolean Functions by OBDDs and Read-K-Times Branching Programs

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

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

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

Short Proofs of the Kneser-Lovász Coloring Principle

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

Calculus Proofs of Some Combinatorial Inequalities

Mathematical Inequalities and Applications
MathematicsApplied Mathematics
2003English

Combinatorial Characterization of Read-Once Formulae

Discrete Mathematics
CombinatoricsTheoretical Computer ScienceDiscrete Mathematics
1993English

Types for Proofs and Programs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2006English

Generalized Minimax Principle in the Calculus of Variations

Duke Mathematical Journal
Mathematics
1935English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy