JCSS 2000 - PDF Preprint Papers

JCSS 2000

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed JCSS-2000 Paper

click to vote

JCSS
2000

121views more JCSS 2000»

The Closure of Monadic NP

13 years 4 months ago

Download reference.kfupm.edu.sa

It is a well-known result of Fagin that the complexity class NP coincides with the class of problems expressible in existential second-order logic ( 1 1), which allows sentences c...

Miklós Ajtai, Ronald Fagin, Larry J. Stockm...

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	121	The Closure of Monadic NP	claim
2	116	Time-Space Tradeoffs for Satisfiability	claim
3	98	Rooted Branching Bisimulation as a Congruence	claim
4	92	Querying Spatial Databases via Topological Invariants	claim
5	86	Improved Algorithms via Approximations of Probability Distributions	claim
6	76	Inequalities for Shannon Entropy and Kolmogorov Complexity	claim
7	74	Deciding Bisimilarity and Similarity for Probabilistic Processes	claim
8	71	Path Constraints in Semistructured Databases	claim
9	58	Editor's Foreword	claim
10	57	Min-Wise Independent Permutations	claim
11	54	The Security of the Cipher Block Chaining Message Authentication Code	claim
12	51	Data Independence of Read, Write, and Control Structures in PRAM Computations	claim
13	44	On the Inapproximability of Disjoint Paths and Minimum Steiner Forest with Bandwidth Constraints	claim
14	37	On the Limits of Nonapproximability of Lattice Problems	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers