Alan R. Woods

According to our database1, Alan R. Woods authored at least 14 papers between 1988 and 2012.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2012
Some Natural Zero One Laws for Ordinals Below ε 0.
Proceedings of the How the World Computes, 2012

2009
On bounded arithmetic augmented by the ability to count certain sets of primes.
J. Symb. Log., 2009

2004
Subset sum "cubes" and the complexity of primality testing.
Theor. Comput. Sci., 2004

2002
A New Proof of the Weak Pigeonhole Principle.
J. Comput. Syst. Sci., 2002

1998
The number of Boolean functions computed by formulas of a given size.
Random Struct. Algorithms, 1998

Unsatisfiable Systems of Equations, Over a Finite Field.
Proceedings of the 39th Annual Symposium on Foundations of Computer Science, 1998

1997
Coloring rules for finite trees, and probabilities of monadic second order sentences.
Random Struct. Algorithms, 1997

Counting Finite Models.
J. Symb. Log., 1997

1995
An Exponenetioal Lower Bound to the Size of Bounded Depth Frege Proofs of the Pigeonhole Principle.
Random Struct. Algorithms, 1995

Approximating the structures accepted by a constant depth circuit or satisfying a sentence-a nonstandard approach.
Proceedings of the Logic and Random Structures, 1995

1994
An Exponential Lower Bound to the Size of Bounded Depth Frege Proofs of the Pigeonhole Principle
Electron. Colloquium Comput. Complex., 1994

1993
Decidability and Undecidability of Theories with a Predicate for the Primes.
J. Symb. Log., 1993

1992
Exponential Lower Bounds for the Pigeonhole Principle
Proceedings of the 24th Annual ACM Symposium on Theory of Computing, 1992

1988
Provability of the Pigeonhole Principle and the Existence of Infinitely Many Primes.
J. Symb. Log., 1988


  Loading...