Does looking inside a circuit help?
From MaRDI portal
Publication:5111215
Recommendations
Cites work
- scientific article; zbMATH DE number 3829252 (Why is no real title available?)
- scientific article; zbMATH DE number 1559537 (Why is no real title available?)
- A second step towards complexity-theoretic analogs of Rice's Theorem
- CREW PRAM<scp>s</scp> and Decision Trees
- Complexity measures and decision tree complexity: a survey.
- Constant Depth Reducibility
- Does looking inside a circuit help?
- Hardness vs randomness
- Looking for an Analogue of Rice's Theorem in Circuit Complexity Theory
- Lower bounds and the hardness of counting properties
- NP is as easy as detecting unique solutions
- On the (im)possibility of obfuscating programs
- On the complexity of circuit satisfiability
- Size of sets with small sensitivity: a generalization of Simon's lemma
- The minimum oracle circuit size problem
- Which problems have strongly exponential complexity?
- BPP has subexponential time simulations unless EXPTIME has publishable proofs
Cited in
(2)
This page was built for publication: Does looking inside a circuit help?
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5111215)