Structure in Complexity Theory, 9th Annual Conference

Be the first to write a review
This Paperback is Not Available through BN.com
See All Options
Sending request ...

More About This Book

Editorial Reviews

Booknews
Papers presented at the Ninth Annual Structure in Complexity Theory Conference, held in Amsterdam, June-July 1994. Among the topics: on the query complexity of clique size and maximum satisfiability; the complexity world below logarithmic space; on the structure of complete sets; time, hardware, and uniformity; predicate classes and promise classes; random debaters and the hardness of approximating stochastic functions; and the complexity of learning with queries. No index. Annotation c. Book News, Inc., Portland, OR (booknews.com)
Read More Show Less

Product Details

  • ISBN-13: 9780818656705
  • Publisher: IEEE Computer Society Press
  • Publication date: 6/28/1994
  • Pages: 408

Table of Contents

Foreword
Committees
Best Student Paper Award
Polynomial-Time Membership Comparable Sets 2
Approximable Sets 12
Polynomial Time Truth-Table Reductions to P-Selective Sets 24
On the Query Complexity of Clique Size and Maximum Satisfiability 31
On Functions Computable with Nonadaptive Queries to NP 43
Using Bounded Query Classes to Separate Classes in the Exponential Time Hierarchy from Classes in PH 53
NL/poly [actual symbol not reproducible] 59
The Complexity World Below Logarithmic Space 64
Some Consequences of Our Failure to Prove Non-Linear Lower Bounds on Explicit Functions 79
A Direct Product Theorem 88
On Ultrafilters and NP 97
Unambiguous Polynomial Hierarchies and Exponential Size 106
On the Structure of Complete Sets 118
Downward Separation Fails Catastrophically for Limited Nondeterminism Classes 134
Generic Separations 139
Weakly Hard Problems 146
Relative to a Random Oracle, NP is Not Small 162
Time, Hardware, and Uniformity 176
Space Lower-Bounds for Pseudorandom-Generators 186
Constructive Separation of Classes of Indistinguishable Ensembles 198
Test Instance Generation for Promised NP Search Problems 205
Random Strings Make Hard Instances 217
Complexity Classes Defined Via k-Valued Functions 224
Predicate Classes and Promise Classes 235
Logspace and Logtime Leaf Languages 242
Logical Definability of Counting Functions 255
Relationships Among PL, #L, and the Determinant 267
Random Debaters and the Hardness of Approximating Stochastic Functions 280
Alternation in Interaction 294
Towards the Parallel Repetition Conjecture 304
Multi-Prover Encoding Schemes and Three-Prover Proof Systems 308
The Complexity of Optimal Queueing Network Control 318
The Complexity of Learning with Queries 324
On the Isomorphism Problem for Weak Reducibilities 338
Generalized CNF Satisfiability Problems and Non-Efficient Approximability 356
Collapsing Degrees in Subexponential Time 367
Complexity Theory and Genetics 383
Author Index 397
Read More Show Less

Customer Reviews

Be the first to write a review
( 0 )
Rating Distribution

5 Star

(0)

4 Star

(0)

3 Star

(0)

2 Star

(0)

1 Star

(0)

Your Rating:

Review Guidelines
Add Recommendations
Your Name: Create a Pen Name or

Barnes & Noble.com Review Rules

Our reader reviews allow you to share your comments on titles you liked, or didn't, with others. By submitting an online review, you are representing to Barnes & Noble.com that all information contained in your review is original and accurate in all respects, and that the submission of such content by you and the posting of such content by Barnes & Noble.com does not and will not violate the rights of any third party. Please follow the rules below to help ensure that your review can be posted.

Reviews by Our Customers Under the Age of 13

We highly value and respect everyone's opinion concerning the titles we offer. However, we cannot allow persons under the age of 13 to have accounts at BN.com or to post customer reviews. Please see our Terms of Use for more details.

What to exclude from your review:

Please do not write about reviews, commentary, or information posted on the product page. If you see any errors in the information on the product page, please send us an email.

Reviews should not contain any of the following:

  • - HTML tags, profanity, obscenities, vulgarities, or comments that defame anyone
  • - Time-sensitive information such as tour dates, signings, lectures, etc.
  • - Single-word reviews. Other people will read your review to discover why you liked or didn't like the title. Be descriptive.
  • - Comments focusing on the author or that may ruin the ending for others
  • - Phone numbers, addresses, URLs
  • - Pricing and availability information or alternative ordering information
  • - Advertisements or commercial solicitation

Reminder:

  • - By submitting a review, you grant to Barnes & Noble.com and its sublicensees the royalty-free, perpetual, irrevocable right and license to use the review in accordance with the Barnes & Noble.com Terms of Use.
  • - Barnes & Noble.com reserves the right not to post any review -- particularly those that do not follow the terms and conditions of these Rules. Barnes & Noble.com also reserves the right to remove any review at any time without notice.
  • - See Terms of Use for other conditions and disclaimers.
Search for Products You'd Like to Recommend

Recommend other products that relate to your review. Just search for them below and share!

Create a Pen Name

Your Pen Name is your unique identity on BN.com. It will appear on the reviews you write and other website activities. Your Pen Name cannot be edited, changed or deleted once submitted.

 
Your Pen Name can be any combination of alphanumeric characters (plus - and _), and must be at least two characters long.

Continue Anonymously
    If you find inappropriate content, please report it to Barnes & Noble
    Why is this product inappropriate?
    Comments (optional)