AbstractYap (1983) shows that each set having small generators is in the class NP/poly which was introduced by Karp and Lipton (1980). We show here that the converse is also true, i.e., each set in NP/poly has small generators. This settles a question left open by Yap (1983). Further, an argument by Meyer stated in Berman and Hartmanis (1977) is generalized to show that a set has small generators if and only if for some sparse set S, A ϵ NP(S)
<p>A subset $X$ of a group $G$ is called $P$-small (almost $P$-small) if there exists an injective ...
We study the consequences of NP having non-uniform polynomial size circuits of various types. We con...
A frontier open problem in circuit complexity is to prove P^{NP} is not in SIZE[n^k] for all k; this...
AbstractYap (1983) shows that each set having small generators is in the class NP/poly which was int...
[EN] Following [22] we study the class S of all groups that admit a small set of generators. Here we...
It was proved by Banakh and Protasov that every group can be generated by a small set (in the sense ...
Introduction One of the important questions in computational complexity theory is whether every NP ...
The main result of this note shows that there exist sparse sets in $NP$ that are not in $P$ if and ...
AbstractWe show that the class AM∩coAM is low for ZPPNP. As a consequence, it follows that Graph Iso...
© Lijie Chen, Dylan M. McKay, Cody D. Murray, and R. Ryan Williams; licensed under Creative Commons ...
This paper investigates the structure of ESPACE under nonuniform Turing reductions that are computed...
We show that if a self-reducible set has polynomial-size circuits, then it is low for the probabilis...
We explore whether various complexity classes can have linear or more generally n k-sized circuit fa...
[EN] We study the behaviour of large, small and medium subsets with respect to homomorphisms and pro...
This paper investigates the structural properties of sets in NP-P and shows that the computational d...
<p>A subset $X$ of a group $G$ is called $P$-small (almost $P$-small) if there exists an injective ...
We study the consequences of NP having non-uniform polynomial size circuits of various types. We con...
A frontier open problem in circuit complexity is to prove P^{NP} is not in SIZE[n^k] for all k; this...
AbstractYap (1983) shows that each set having small generators is in the class NP/poly which was int...
[EN] Following [22] we study the class S of all groups that admit a small set of generators. Here we...
It was proved by Banakh and Protasov that every group can be generated by a small set (in the sense ...
Introduction One of the important questions in computational complexity theory is whether every NP ...
The main result of this note shows that there exist sparse sets in $NP$ that are not in $P$ if and ...
AbstractWe show that the class AM∩coAM is low for ZPPNP. As a consequence, it follows that Graph Iso...
© Lijie Chen, Dylan M. McKay, Cody D. Murray, and R. Ryan Williams; licensed under Creative Commons ...
This paper investigates the structure of ESPACE under nonuniform Turing reductions that are computed...
We show that if a self-reducible set has polynomial-size circuits, then it is low for the probabilis...
We explore whether various complexity classes can have linear or more generally n k-sized circuit fa...
[EN] We study the behaviour of large, small and medium subsets with respect to homomorphisms and pro...
This paper investigates the structural properties of sets in NP-P and shows that the computational d...
<p>A subset $X$ of a group $G$ is called $P$-small (almost $P$-small) if there exists an injective ...
We study the consequences of NP having non-uniform polynomial size circuits of various types. We con...
A frontier open problem in circuit complexity is to prove P^{NP} is not in SIZE[n^k] for all k; this...
DOI
Add to ORKG