Special issue: 17th ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems, Seattle, WA, USA, June 1--3, 1998

DOI10.1006/jcss.1999.1674zbMath0968.00051OpenAlexW2180548934MaRDI QIDQ5929910

No author found.

Publication date: 27 August 2001

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jcss.1999.1674

zbMATH Keywords

PapersSymposiumSpecial issueACM SIGACT-SIGMOD-SIGART symposiumDatabase systemsSeattle, WA (USA)

Mathematics Subject Classification ID

Proceedings of conferences of miscellaneous specific interest (00B25) Proceedings, conferences, collections, etc. pertaining to computer science (68-06)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Cook versus Karp-Levin: Separating completeness notions if NP is not small
• A uniform approach to obtain diagonal sets in complexity classes
• Sparse complete sets for NP: solution of a conjecture of Berman and Hartmanis
• Almost everywhere high nonuniform complexity
• A comparison of polynomial time reducibilities
• On 1-truth-table-hard languages
• Genericity and measure for exponential time
• Resource bounded randomness and weakly complete problems
• On the Structure of Polynomial Time Reducibility
• P-selective sets, tally languages, and the behavior of polynomial time reducibilities onNP
• The Complexity of Decision Versus Search

This page was built for publication: Special issue: 17th ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems, Seattle, WA, USA, June 1--3, 1998