JCSS 1998 - PDF Preprint Papers

JCSS 1998

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed JCSS-1998 Paper

click to vote

JCSS
1998

74views more JCSS 1998»

Reductions in Circuit Complexity: An Isomorphism Theorem and a Gap Theorem

13 years 4 months ago

Download www.cs.rutgers.edu

We show that all sets that are complete for NP under non-uniform AC0 reductions are isomorphic under non-uniform AC0-computable isomorphisms. Furthermore, these sets remain NP-com...

Manindra Agrawal, Eric Allender, Steven Rudich

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status

1	74	Reductions in Circuit Complexity: An Isomorphism Theorem and a Gap Theorem	claim
2	65	Good Degree Bounds on Nullstellensatz Refutations of the Induction Principle	claim
3	53	Approximating Hyper-Rectangles: Learning and Pseudorandom Sets	claim
4	51	Randomized Query Processing in Robot Path Planning	claim
5	45	The Relative Complexity of NP Search Problems	claim
6	39	DNA Models and Algorithms for NP-Complete Problems	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers