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

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

2006-04-06

arxiv.org/abs/cs/0604024v1

Computer Science

Computational Complexity

8 pages

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Cohomology in Grothendieck Topologies and Lower Bounds in Boolean Complexity II: A Simple Example does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Cohomology in Grothendieck Topologies and Lower Bounds in Boolean Complexity II: A Simple Example, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Cohomology in Grothendieck Topologies and Lower Bounds in Boolean Complexity II: A Simple Example will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-723300