DOIAbstract
AbstractIn this short note, we show that for any integer k, there are languages in the complexity class PP that do not have Boolean circuits of size nk
AbstractIn this short note, we show that for any integer k, there are languages in the complexity class PP that do not have Boolean circuits of size nk
grantor: University of TorontoUniform complexity classes are typically defined in terms of...
We prove that if every problem in NP has nk-size circuits for a fixed constant k, then for every NP-...
AbstractThis article surveys the links between regular languages and the class NC1, showing their im...
As remarked in Cook (“Towards a Complexity Theory of Synchronous Parallel Computation,≓ Univ. of Tor...
We explore whether various complexity classes can have linear or more generally n k-sized circuit fa...
We explore whether various complexity classes can have linear or more generally n k-sized circuit fa...
Proving that there are problems in $P^{NP}$ that require boolean circuits of super-linear size is a ...
Proving that there are problems in $P^{NP}$ that require boolean circuits of super-linear size is a ...
Rice's Theorem states that all nontrivial language properties of recursively enumerable sets are und...
This note connects two topics of Complexity Theory: The topic of succinct circuit representations i...
AbstractRazborov and Rudich have proved that, under a widely-believed hypothesis about pseudorandom ...
The Minimum Circuit Size Problem (MCSP) and a related problem (MKTP) that deals with time-bounded Ko...
AbstractThis paper develops techniques for studying complexity classes that are not covered by known...
This paper develops techniques for studying complexity classes that are not covered by known recurs...
We study Boolean circuits as a representation of Boolean functions andconsider different equivalence...
grantor: University of TorontoUniform complexity classes are typically defined in terms of...
We prove that if every problem in NP has nk-size circuits for a fixed constant k, then for every NP-...
AbstractThis article surveys the links between regular languages and the class NC1, showing their im...
As remarked in Cook (“Towards a Complexity Theory of Synchronous Parallel Computation,≓ Univ. of Tor...
We explore whether various complexity classes can have linear or more generally n k-sized circuit fa...
We explore whether various complexity classes can have linear or more generally n k-sized circuit fa...
Proving that there are problems in $P^{NP}$ that require boolean circuits of super-linear size is a ...
Proving that there are problems in $P^{NP}$ that require boolean circuits of super-linear size is a ...
Rice's Theorem states that all nontrivial language properties of recursively enumerable sets are und...
This note connects two topics of Complexity Theory: The topic of succinct circuit representations i...
AbstractRazborov and Rudich have proved that, under a widely-believed hypothesis about pseudorandom ...
The Minimum Circuit Size Problem (MCSP) and a related problem (MKTP) that deals with time-bounded Ko...
AbstractThis paper develops techniques for studying complexity classes that are not covered by known...
This paper develops techniques for studying complexity classes that are not covered by known recurs...
We study Boolean circuits as a representation of Boolean functions andconsider different equivalence...
grantor: University of TorontoUniform complexity classes are typically defined in terms of...
We prove that if every problem in NP has nk-size circuits for a fixed constant k, then for every NP-...
AbstractThis article surveys the links between regular languages and the class NC1, showing their im...
Add to ORKG