On membership comparable sets
type: Item
instance of: scholarly article
title: On membership comparable sets
zbMATH Open document ID: 0948.68086
author: Yanyan Li
published in: Journal of Computer and System Sciences
publication date: 2000-01-17T00:00:00Z
Mathematics Subject Classification ID: 68Q15
zbMATH DE Number: 1389787
zbMATH Keywords: UniqueSAT
MaRDI profile type: Publication
cites work: Q4230375
cites work: Q4004078
cites work: Q4527016
cites work: Q4251059
cites work: Quantifying the amount of verboseness
cites work: Approximable sets
cites work: \(p\)-selective self-reducible sets: a new characterization of P
cites work: Enumerative counting is hard
cites work: On the existence of hard sparse sets under weak reductions
cites work: Q4359456
cites work: Short propositional formulas represent nondeterministic computations
cites work: Q4075484
cites work: Q4252721
cites work: Q4364576
cites work: The complexity of promise problems with applications to public-key cryptography
cites work: \(p\)-Selective sets and reducing search to decision vs. self-reducibility
cites work: On self-reducibility and weak P-selectivity
cites work: Factoring polynomials with rational coefficients
cites work: Q4252720
cites work: On the density of families of sets
cites work: P-selective sets, tally languages, and the behavior of polynomial time reducibilities onNP
cites work: Reductions on NP and p-selective sets
cites work: A combinatorial problem; stability and order for models and theories in infinitary languages
cites work: On polynomial-time truth-table reducibility of intractable sets to P-selective sets
cites work: Q4942650
cites work: Q3946078
cites work: NP is as easy as detecting unique solutions
description: scientific article; zbMATH DE number 1389787