Peer Evaluation activity
This was brought to you by:
Followblock this user Eric Allender Trusted member
Dept. of Computer Science, Rutgers University, Piscataway, NJ
The complexity of satisfiability problems: Refining Schaefer's theorem☆
Your session has expired but don’t worry, your message
has been saved.Please log in and we’ll bring you back
to this page. You’ll just need to click “Send”.
Your mailing list is currently empty.
It will build up as you send messages
and links to your peers.
Your message has been sent.
Author(s) : Eric Allender, Michael Bauland, Neil Immerman, Henning Schnoor, Heribert Vollmer
Subject : unspecified
Area : Other
Language : English
Year : 2009
|Affiliations :||Dept. of Computer Science, Rutgers University, Piscataway, NJ|
Volume : 75
Issue : 4
Publisher : Elsevier Inc.
Pages : 245 - 254
Url : http://linkinghub.elsevier.com/retrieve/pii/S0022000008001141
Doi : 10.1016/j.jcss.2008.11.001
Leave a comment
This contribution has not been reviewed yet. review?
You may receive the Trusted member label after :
• Reviewing 10 uploads, whatever the media type.
• Being trusted by 10 peers.
• If you are blocked by 10 peers the "Trust label" will be suspended from your page. We encourage you to contact the administrator to contest the suspension.
Please select an affiliation to sign your evaluation:
Please select an affiliation:
Eric's Peer Evaluation activity
- 1On strong separations from AC^0
- 1P-uniform circuit complexity
- 1On TC 0 , AC 0 , and Arithmetic Circuits
- 1Rudimentary reductions revisited 1 Introduction 2 Preliminaries
- 1A Note on the Representational Incompatibility of Function Approximation and Factored Dynam- ics
- 1A Note on the Representational Incompatabilty of Function Approximation and Factored Dynamics.
- 1On the complexity of numerical analysis
- 1Arithmetic Complexity, Kleene Closure, and Formal Power Series
- 1The complexity of computing maximal word functions
- 1Bounded depth arithmetic circuits: Counting and closure
- 1A First-Order Isomorphism Theorem
- 1Circuit Complexity before the Dawn of the New Millennium
- 1When Worlds Collide: Derandomization, Lower Bounds, and Kolmogorov Complexity
- 1Isolation, Matching, and Counting Uniform and Nonuniform Upper Bounds
- 1Randomness as Circuit Complexity ( and the Connection to Pseudorandomness )
- 1Cracks in the defenses: Scouting out approaches on circuit lower bounds
- 1Power from random strings
- 1The directed planar reachability problem
- 1A Note on the Representational Incompatibility of Function Approximation and Factored Dynamics
- 1Uniform Derandomization from Pathetic Lower Bounds
- 1Circuit complexity before the dawn of the new millennium
- 1Arithmetic Circuits and Counting Complexity Classes
- 1Making computation count
- 1The complexity of satisfiability problems: Refining Schaefer's theorem☆
- 1Avoiding Simplicity is Complex
Full Text request
Your request will be sent.
Please enter your email address to be notified
when this article becomes available