• Corpus ID: 58804

Cohomology in Grothendieck Topologies and Lower Bounds in Boolean Complexity II: A Simple Example

@article{Friedman2006CohomologyIG,
  title={Cohomology in Grothendieck Topologies and Lower Bounds in Boolean Complexity II: A Simple Example},
  author={J. Friedman},
  journal={ArXiv},
  year={2006},
  volume={abs/cs/0512008}
}
  • J. Friedman
  • Published 1 December 2005
  • Mathematics, Computer Science
  • ArXiv
In a previous paper we have suggested a number of ideas to attack circuit size complexity with cohomology. As a simple example, we take circuits that can only compute the AND of two inputs, which essentially reduces to SET COVER. We show a very special case of the cohomological approach (one particular free category, using injective and superskyscraper sheaves) gives the linear programming bound coming from the relaxation of the standard integer programming reformulation of SET COVER. 
6 Citations
Linear Transformations in Boolean Complexity Theory
TLDR
This work attempts to understand a cohomological approach to lower bounds in Boolean circuits by studying a very restricted case by studying the kernel (or nullspace) of a fairly simple linear transformation and its transpose.
The Strengthened Hanna Neumann Conjecture I: A Combinatorial Proof ∗
We prove the Strengthened Hanna Neumann Conjecture, using a common \bre product in graphs" formulation of the conjecture. Our original approach used sheaf theory, although here we give a proof with
Extreme Rays of AND-Measures in Circuit Complexity
This paper is motivated by the problem of proving lower bounds on the formula size of boolean functions, which leads to lower bounds on circuit depth. We know that formula size is bounded from below
A Proof of the Strengthened Hanna Neumann Conjecture
We prove the Strengthened Hanna Neumann Conjecture. We give a more direct cohomological interpretation of the conjecture in terms of “typical” covering maps, and use graph Galois theory to
A sheaf-theoretic description of Khovanov's knot homology
We give a description of Khovanov's knot homology theory in the language of sheaves. To do this, we identify two cohomology theories associated to a commutative diagram of abelian groups indexed by
Sheaves on Graphs and Their Homological Invariants
We introduce a notion of a sheaf of vector spaces on a graph, and develop the foundations of homology theories for such sheaves. One sheaf invariant, its "maximum excess," has a number of remarkable

References

SHOWING 1-10 OF 35 REFERENCES
Geometric Complexity Theory I: An Approach to the P vs. NP and Related Problems
TLDR
The notion of a partially stable point in a reductive-group representation is introduced, which generalizes the notion of stability in geometric invariant theory due to Mumford and reduces fundamental lower bound problems in complexity theory to problems concerning infinitesimal neighborhoods of the orbits of partially stable points.
Lower bounds for algebraic computation trees
  • M. Ben-Or
  • Computer Science, Mathematics
    STOC
  • 1983
TLDR
All the apparently known lower bounds for linear decision trees are extended to bounded degree algebraic decision trees, thus answering the open questions raised by Steele and Yao [20].
Grothendieck ring of pretriangulated categories
We consider the abelian group PT generated by quasi-equivalence classes of pretriangulated DG categories with relations coming from semiorthogonal decompositions of corresponding triangulated
Combinatorial duality and intersection product: A direct approach
The proof of the Combinatorial Hard Lefschetz Theorem for the “virtual” intersection cohomology of a not necessarily rational polytopal fan as presented by Karu completely establishes Stanley’s
Residues and Duality: Lecture Notes of a Seminar on the Work of A. Grothendieck, Given at Harvard 1963 /64
The derived category.- Application to preschemes.- Duality for projective morphisms.- Local cohomology.- Dualizing complexes and local duality.- Residual complexes.- The duality theorem.
Lower Bounds for Algebraic Decision Trees
TLDR
A topological method is given for obtaining lower bounds for the height of algebraic decision trees and an Ω(n2) bound is obtained for trees with bounded-degree polynomial tests, thus extending the Dobkin-Lipton result for linear trees.
Topological hypercovers and 1-realizations
Abstract.We show that if U* is a hypercover of a topological space X then the natural map hocolim U* → X is a weak equivalence. This fact is used to construct topological realization functors for the
Natural Proofs
We introduce the notion ofnaturalproof. We argue that the known proofs of lower bounds on the complexity of explicit Boolean functions in nonmonotone models fall within our definition of natural. We
Reconstruction of a Variety from the Derived Category and Groups of Autoequivalences
We consider smooth algebraic varieties with ample either canonical or anticanonical sheaf. We prove that such a variety is uniquely determined by its derived category of coherent sheaves. We also
The complexity of Boolean functions
TLDR
This chapter discusses Circuits and other Non-Uniform Computation Methods vs. Turing Machines and other Uniform Computation Models, and the Design of Efficient Circuits for Some Fundamental Functions.
...
1
2
3
4
...