A 5n− o (n) Lower Bound on the Circuit Size over U 2 of a Linear Boolean Function

, &
In S. Barry Cooper (ed.), How the World Computes. pp. 432--439 (2012)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,219

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Interpolation theorems, lower Bounds for proof systems, and independence results for bounded arithmetic.Jan Krajíček - 1997 - Journal of Symbolic Logic 62 (2):457-486.
The number of openly generated Boolean algebras.Stefan Geschke & Saharon Shelah - 2008 - Journal of Symbolic Logic 73 (1):151-164.
Adding a Cohen real adds an entangled linear order.Yoshifumi Yuasa - 1993 - Archive for Mathematical Logic 32 (4):299-304.
Lower Bounds for resolution and cutting plane proofs and monotone computations.Pavel Pudlák - 1997 - Journal of Symbolic Logic 62 (3):981-998.
An exponential lower bound for a constraint propagation proof system based on ordered binary decision diagrams.Jan Krajíček - 2008 - Journal of Symbolic Logic 73 (1):227-237.
Does truth-table of linear norm reduce the one-query tautologies to a random oracle?Masahiro Kumabe, Toshio Suzuki & Takeshi Yamazaki - 2008 - Archive for Mathematical Logic 47 (2):159-180.
Bounds on the competence of a homogeneous jury.Alexander Zaigraev & Serguei Kaniovski - 2012 - Theory and Decision 72 (1):89-112.
Y = 2x vs. Y = 3x.Alexei Stolboushkin & Damian Niwiński - 1997 - Journal of Symbolic Logic 62 (2):661-672.
$Y = 2x$ vs. $y = 3x$.Alexei Stolboushkin & Damian Niwinski - 1997 - Journal of Symbolic Logic 62 (2):661-672.
On Partial Classes Containig All Monotone and Zero-Preserving Total Boolean Functions.Birger Strauch - 1997 - Mathematical Logic Quarterly 43 (4):510-524.
On meta complexity of propositional formulas and propositional proofs.Pavel Naumov - 2008 - Archive for Mathematical Logic 47 (1):35-52.
On a Question of Phillips.Çiǧdem Gencer & Mehmet Terziler - 1997 - Mathematical Logic Quarterly 43 (1):78-82.
On the Structure of the Medvedev Lattice.Sebastiaan A. Terwijn - 2008 - Journal of Symbolic Logic 73 (2):543 - 558.
Lower Bounds for cutting planes proofs with small coefficients.Maria Bonet, Toniann Pitassi & Ran Raz - 1997 - Journal of Symbolic Logic 62 (3):708-728.
Chains and antichains in interval algebras.M. Bekkali - 1994 - Journal of Symbolic Logic 59 (3):860-867.

Analytics

Added to PP
2014-01-28

Downloads
27 (#557,528)

6 months
3 (#902,269)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references