# Pigeonhole sort

## Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2004

2004

Dual weak pigeonhole principle, pseudo-surjective functions, and provability of circuit lower bounds

- 2004

Â

Is this relevant?

2004

2004

- Arch. Math. Log.
- 2004

We show that short bounded-depth Frege proofs of matrix identities, such as PQ = I âŠƒ QP = I (over the field of two elementsâ€¦Â (More)

Is this relevant?

Highly Cited

2002

Highly Cited

2002

- SIAM J. Comput.
- 2002

We consider several problems related to the use of resolution-based methods for determining whether a given boolean formula inâ€¦Â (More)

Is this relevant?

Highly Cited

1996

Highly Cited

1996

- FOCS
- 1996

We give simple new lower bounds on the lengths of Resolution proofs for the pigeonhole principle and for randomly generatedâ€¦Â (More)

Is this relevant?

1994

1994

- 1994

Constraint satisfaction problems (CSP's) involve nding values for variables subject to constraints on which combinations ofâ€¦Â (More)

Is this relevant?

Highly Cited

1993

Highly Cited

1993

- ISMIS
- 1993

1 I n t r o d u c t i o n Constraint satisfaction problems (CSP) are a class of combinatorial problems that can be solvedâ€¦Â (More)

Is this relevant?

Highly Cited

1992

Highly Cited

1988

Highly Cited

1988

- J. Symb. Log.
- 1988

Press are collaborating with JSTOR to digitize, preserve and extend access to The Journal of Symbolic Logic. JSTOR is a not-forâ€¦Â (More)

Is this relevant?

Highly Cited

1985

Highly Cited

1985

- J. ACM
- 1985

A parallel algorithm is presented that accepts as input a graph <italic>G</italic> and produces a maximal independent set ofâ€¦Â (More)

Is this relevant?

Highly Cited

1985

Highly Cited

1985

- Theor. Comput. Sci.
- 1985

We prove that, for infinitely many disjunctive normal form propositional calculus tautologies ~:, the length of the shortestâ€¦Â (More)

Is this relevant?