LCC 1994 - PDF Preprint Papers

LCC 1994 International Workshop on Logic and Computational Complexity

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed LCC-1994 Paper

click to vote

LCC
1994

85views Algorithms» more LCC 1994»

Comparing the Power of Monadic NP Games

1 years 9 months ago

Download www.almaden.ibm.com

The descriptive complexity of a problem is the complexity of describing the problem in some logical formalism. One of the few techniques for proving separation results in descripti...

Ronald Fagin

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	85	Comparing the Power of Monadic NP Games	claim
2	69	Expressing Computational Complexity in Constructive Type Theory	claim
3	69	Preservation Theorems in Finite Model Theory	claim
4	68	Linear Constraint Query Languages: Expressive Power and Complexity	claim
5	66	Program Extraction from Classical Proofs	claim
6	66	On Herbrand's Theorem	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers