Does Looking Inside a Circuit Help (Q5111215): Difference between revisions

@@ label / en / label / en @@
+Does Looking Inside a Circuit Help
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+The minimum oracle circuit size problem
@@ Property / cites work: The minimum oracle circuit size problem / rank @@
+Normal rank
@@ Property / cites work @@
+Size of Sets with Small Sensitivity: A Generalization of Simon’s Lemma
+Normal rank
@@ Property / cites work @@
+\(BPP\) has subexponential time simulations unless \(EXPTIME\) has publishable proofs
+Normal rank
@@ Property / cites work @@
+On the (im)possibility of obfuscating programs
@@ Property / cites work: On the (im)possibility of obfuscating programs / rank @@
+Normal rank
@@ Property / cites work @@
+Looking for an Analogue of Rice's Theorem in Circuit Complexity Theory
+Normal rank
@@ Property / cites work @@
+Complexity measures and decision tree complexity: a survey.
+Normal rank
@@ Property / cites work @@
+Constant Depth Reducibility
@@ Property / cites work: Constant Depth Reducibility / rank @@
+Normal rank
@@ Property / cites work @@
+A second step towards complexity-theoretic analogs of Rice's Theorem
+Normal rank
@@ Property / cites work @@
+Lower bounds and the hardness of counting properties
+Normal rank
@@ Property / cites work @@
+Does Looking Inside a Circuit Help
@@ Property / cites work: Does Looking Inside a Circuit Help / rank @@
+Normal rank
@@ Property / cites work @@
+Which problems have strongly exponential complexity?
+Normal rank
@@ Property / cites work @@
+Q4526985
@@ Property / cites work: Q4526985 / rank @@
+Normal rank
@@ Property / cites work @@
+CREW PRAM<scp>s</scp> and Decision Trees
@@ Property / cites work: CREW PRAM<scp>s</scp> and Decision Trees / rank @@
+Normal rank
@@ Property / cites work @@
+Hardness vs randomness
@@ Property / cites work: Hardness vs randomness / rank @@
+Normal rank
@@ Property / cites work @@
+On the complexity of circuit satisfiability
@@ Property / cites work: On the complexity of circuit satisfiability / rank @@
+Normal rank
@@ Property / cites work @@
+Q3674058
@@ Property / cites work: Q3674058 / rank @@
+Normal rank
@@ Property / cites work @@
+NP is as easy as detecting unique solutions
@@ Property / cites work: NP is as easy as detecting unique solutions / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.4230/LIPIcs.MFCS.2017.1
+Normal rank
@@ Property / OpenAlex ID @@
+W2774527366
@@ Property / OpenAlex ID: W2774527366 / rank @@
+Normal rank
@@ Property / title @@
+Does Looking Inside a Circuit Help (English)
@@ Property / title: Does Looking Inside a Circuit Help (English) / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:5111215