Add to ORKGIn this note we show that if there are sparse NP complete sets with a polynomial time computable census function then $P=NP$. We also derive related results about the complexity of the census function for context-sensitive languages and $\log n$-tape bounded languages
P versus NP is considered as one of the most important open problems in computer science. This consi...
In this paper we study the consequences of the existence of sparse hard sets for different complexit...
AbstractWe present several problems regarding counting full words compatible with a set of partial w...
We study the question of whether every P set has an easy (i.e., polynomial-time computable) census f...
AbstractWe study the question of whether every P set has an easy (i.e., polynomial-time computable) ...
Introduction One of the important questions in computational complexity theory is whether every NP ...
P versus NP is considered as one of the most important open problems in computer science. This consi...
Hartmanis and Berman have conjectured that all NP-complete sets are polynomial time isomorphic. A c...
If all NP complete sets are isomorphic under deterministic polynomial time mappings (p-isomorphic) ...
A sparse language is a formal language such that the number of strings of length $n$ is bounded by a...
We discuss the history and uses of the parallel census technique---an elegant tool in the study of c...
AbstractPNP[O(log n)] is the class of languages recognizable by deterministic polynomial time machin...
Under the hypothesis that NP does not have p-measure 0 (roughly, that NP contains more than a neglig...
Ogiwara and Watanabe have recently shown that the hypothesis P ¿ NP implies that no (polynomially) s...
P versus NP is considered as one of the most important open problems in computer science. This consi...
In this paper we study the consequences of the existence of sparse hard sets for different complexit...
AbstractWe present several problems regarding counting full words compatible with a set of partial w...
We study the question of whether every P set has an easy (i.e., polynomial-time computable) census f...
AbstractWe study the question of whether every P set has an easy (i.e., polynomial-time computable) ...
Introduction One of the important questions in computational complexity theory is whether every NP ...
P versus NP is considered as one of the most important open problems in computer science. This consi...
Hartmanis and Berman have conjectured that all NP-complete sets are polynomial time isomorphic. A c...
If all NP complete sets are isomorphic under deterministic polynomial time mappings (p-isomorphic) ...
A sparse language is a formal language such that the number of strings of length $n$ is bounded by a...
We discuss the history and uses of the parallel census technique---an elegant tool in the study of c...
AbstractPNP[O(log n)] is the class of languages recognizable by deterministic polynomial time machin...
Under the hypothesis that NP does not have p-measure 0 (roughly, that NP contains more than a neglig...
Ogiwara and Watanabe have recently shown that the hypothesis P ¿ NP implies that no (polynomially) s...
P versus NP is considered as one of the most important open problems in computer science. This consi...
In this paper we study the consequences of the existence of sparse hard sets for different complexit...
AbstractWe present several problems regarding counting full words compatible with a set of partial w...