yusuke1997/dblp-id-title huggingface dataset:
Increasing the Gap between Descriptional Complexity and Algorithmic Probability
Proceedings of the 28th Conference on Computational Complexity, CCC 2013, K.lo Alto, California, USA, 5-7 June, 2013
Constraint Satisfaction: The Approximability of Minimization Problems
Proofs, Codes, and Polynomial-Time Reducibilities
Some Properties of Exponential Time Complexity Classes
Non-uniform ACC Circuit Lower Bounds
Almost Everywhere High Nonuniform Complexity
The Complexity of the Separable Hamiltonian Problem
Expanders from Symmetric Codes
Proceedings: Fourth Annual Structure in Complexity Theory Conference, University of Oregon, Eugene, Oregon, USA, June 19-22, 1989
Computationally Private Randomizing Polynomials and Their Applications
Optimal Separation of EROW and CROWPRAMs
Pseudorandom Generators for Read-Once ACC^0
A Subquadratic Upper Bound on Sum-Of-Squares Composition Formulas
Parallel Computation with Threshold Functions
Consequences and Limits of Nonlocal Strategies
A Technique for Hardness Amplification Against AC⁰
Complexity-Theoretic Foundations of Quantum Supremacy Experiments
A zero one law for RP
Progress on collapsing degrees
Lower Bounds for Linear Locally Decodable Codes and Private Information Retrieval
Randomised Individual Communication Complexity
How to Compress Asymmetric Communication
Approximation Algorithms for QMA-Complete Problems
List Decoding Barnes-Wall Lattices
On Separators, Segregators and Time versus Space
Acceptance by Transformation Monoids (with an Application to Local Self Reductions)
From Weak to Strong LP Gaps for All CSPs
Circuit Lower Bounds Collapse Relativized Complexity Classes
On Limited Nondeterminism and the Complexity of the V.C Dimension (Extended Abstract)
Frequency Computation and Bounded Queries
Nondeterministic space is closed under complementation
Some Consequences of Our Failure to Prove Non-Linear Lower Bounds on Explicit Functions
Relativized NP Search Problems and Propositional Proof Systems
Distribution Testing Lower Bounds via Reductions from Communication Complexity
The probabilistic communication complexity of set intersection
Unbalanced Expanders and Randomness Extractors from Parvaresh-Vardy Codes
Learning Complexity vs. Communication Complexity
Complexity Lower Bounds through Balanced Graph Properties
On Correlation Bounds Against Polynomials
On Reductions of NP Sets to Sparse Sets
Restricted Information from Nonadaptive Queries to NP
A Note on One- Way Functions and Polynomial Time Isomorphisms
Characterizing Derandomization Through Hardness of Levin-Kolmogorov Complexity
On C-Degrees, H-Degrees and T-Degrees
Derandomization and Distinguishing Complexity
Trading reversals for alternation
The Query Complexity of Order-Finding
Perfect Parallel Repetition Theorem for Quantum XOR Proof Systems
Alternation in Interaction
Query-to-Communication Lifting for P^NP
Average Dependence and Random Oracles
More on Noncommutative Polynomial Identity Testing
Lifting with Colourful Sunflowers
Lower Bounds for Multi-Player Pointer Jumping
Deterministic Approximate Counting for Juntas of Degree-2 Polynomial Threshold Functions
On Membership Comparable Sets
Efficient Iterations for Algebraic Numbers
Decoding Reed-Muller Codes Over Product Sets
Lipschitz Continuous Ordinary Differential Equations are Polynomial-Space Complete
40th Computational Complexity Conference, CCC 2025, Toronto, Canada, August 5-8, 2025
Resolution Complexity of Independent Sets in Random Graphs
Efficient Arguments without Short PCPs
On Separating Complexity Classes
On Ranomization in Online Computation
Reductions of Self-Reducible Sets to Depth-1 Weighted Threshold Circuit Classes, and Sparse Sets
The Perceptron Strikes Back
Proof Complexity Lower Bounds from Algebraic Circuit Complexity
New Results in the Simultaneous Message Passing Model via Information Theoretic Techniques
On the Relative Efficiency of Resolution-Like Proofs and Ordered Binary Decision Diagram Proofs
Streaming Zero-Knowledge Proofs
Proceedings of the 17th Annual IEEE Conference on Computational Complexity, Montréal, Québec, Canada, May 21-24, 2002
Time-Space Lower Bounds for Two-Pass Learning
Limits on Alternation-Trading Proofs for Time-Space Lower Bounds
A Stress-Free Sum-Of-Squares Lower Bound for Coloring
Oracles for Structural Properties: The Isomorphism Problem and Public-Key Cryptography
Complexity Issues in Markov Decision Processes
The Power of Natural Properties as Oracles
Complexity Classification of Conjugated Clifford Circuits
Isomorphisms and 1-L Reductions
NP-hardness of Minimum Circuit Size Problem for OR-AND-MOD Circuits
Proceedings of the Eleveth Annual IEEE Conference on Computational Complexity, Philadelphia, Pennsylvania, USA, May 24-27, 1996
Identifying an Honest EXP^NP Oracle Among Many
Deterministic Polynomial Identity Testing in Non-Commutative Models
Relativized polynomial time hierarchies having exactly K levels
One-Way Functions and the Berman-Hartmanis Conjecture
On the Polynomial Parity Argument Complexity of the Combinatorial Nullstellensatz
Learning DNF by Approximating Inclusion-Exclusion Formulae
Deterministic Identity Testing for Sum of Read-once Oblivious Arithmetic Branching Programs
Bounding the Complexity of Advice Functions
Tight Bounds for Communication-Assisted Agreement Distillation
On Arthur Merlin Games in Communication Complexity
Prior Entanglement, Message Compression and Privacy in Quantum Communication
A Pseudorandom Generator for Polynomial Threshold Functions of Gaussian with Subpolynomial Seed Length
The Distinguishability of Product Distributions by Read-Once Branching Programs
Hardness of Constant-Round Communication Complexity
On Span Programs
Information Theory Methods in Communication Complexity
Parallel Complexity Hierarchies Based on PRAMs and DLOGTIME-Uniform Circuits
How to Get More Mileage from Randomness Extractors
On Positive P
Random Arithmetic Formulas Can Be Reconstructed Efficiently
38th Computational Complexity Conference, CCC 2023, Warwick, UK, July 17-20, 2023
Exponential Time and Bounded Arithmetic
Theory of Periodically Specified Problems: Complexity and Approximability
Asymptotically-Good RLCCs with (log n)^(2+o(1)) Queries
Test Instance Generation for Promise NP Search Problems
On tally relativizations of BP-complexity classes
Fourier and Circulant Matrices Are Not Rigid
Proof Complexity of Natural Formulas via Communication Arguments
Trading Information Complexity for Error
Direct Sums for Parity Decision Trees
On the Algebraic Proof Complexity of Tensor Isomorphism
Sparser Abelian High Dimensional Expanders
A Purely Logical Characterization of Circuit Uniformity
An Entropy Sumset Inequality and Polynomially Fast Convergence to Shannon Capacity Over All Alphabets
Relationships between NP-sets, Co-NP-sets, and P-sets relative to random oracles
Properties of NP-Complete Sets
Random Measurement Bases, Quantum State Distinction and Applications to the Hidden Subgroup Problem
NL/poly <= +/poly (Preliminary Version)
An Application of Matroid Theory to the SAT Problem
Solving Intractable Problems with DNA Computing
The Power of Parallel Random Access Machines with Augmented Instruction Sets
Polynomials, Quantum Query Complexity, and Grothendieck's Inequality
Tree Resolution Proofs of the Weak Pigeon-Hole Principle
Decomposing NC and AC
On the Sum of L1 Influences
Exponential Separation Between Powers of Regular and General Resolution over Parities
Non-Malleable Extractors - New Tools and Improved Constructions
The Gaussian Surface Area and Noise Sensitivity of Degree-d Polynomial Threshold Functions
A PRG for Boolean PTF of Degree 2 with Seed Length Subpolynomial in epsilon and Logarithmic in n
The Complexity of Learning with Queries
Polynomial-time Optimization, Parallel Approximation, and Fixpoint Logic (Extended Abstract)
Communication Complexity with Defective Randomness
Nonrelativizing Separations
Soft Decoding, Dual BCH Codes, and Better List-Decodable e-Biased Codes
Proceedings of the 15th Annual IEEE Conference on Computational Complexity, Florence, Italy, July 4-7, 2000
Semi-Unbounded Fan-In Circuits: Boolean vs. Arithmetic
Generalized Quantum Arthur-Merlin Games
Disjoint NP-Pairs
P-Selective Sets, and Reducing Search to Decision vs. Self-Reducability
Majority is Incompressible by AC^0[p] Circuits
On The Power of PP
Proceedings of the Eigth Annual Structure in Complexity Theory Conference, San Diego, CA, USA, May 18-21, 1993
3-MANIFOLD KNOT GENUS is NP-complete
Typically-Correct Derandomization for Small Time and Space
Proceedings of the 14th Annual IEEE Conference on Computational Complexity, Atlanta, Georgia, USA, May 4-6, 1999
A Combinatorial Characterization of Resolution Width
Tight Size-Degree Bounds for Sums-of-Squares Proofs
The Communication Complexity of Enumeration, Elimination, and Selection
Bounded query computations
A 3-Query Non-Adaptive PCP with Perfect Completeness
Boolean Functions, Invariance Groups and Parallel Complexity
Non-Disjoint Promise Problems from Meta-Computational View of Pseudorandom Generator Constructions
On Matrix Rigidity and Locally Self-Correctable Codes
Communication Complexity Lower Bounds by Polynomials
A Direct Product Theorem
Seperating Complexity Classes Related to Certain Input Oblivious Logarithmic Space-Bounded Turing Machines
On Derandomizing Tests for Certain Polynomial Identities
On the Hardness of Distinguishing Mixed-State Quantum Computations
On hiding information from an oracle
Robustly Self-Ordered Graphs: Constructions and Applications to Property Testing
On the Partial Derivative Method Applied to Lopsided Set-Multilinear Polynomials
On threshold circuits and polynomial computation
An Improved Trickle down Theorem for Partite Complexes
Correlation Bounds Against Monotone NC^1
Derandomizing Polynomial Identity Testing for Multilinear Constant-Read Formulae
Majority Gates vs. General Weighted Threshold Gates
An Oracle Separating +P From PP ph
Hard Examples for Bounded Depth Frege
Extremely Efficient Constructions of Hash Functions, with Applications to Hardness Magnification and PRFs
Nondeterministic NC 1 Computation
The Isomorphism Conjecture Fails Relative to a Random Oracle (abstract)
Non-Uniform Complexity Classes and Random Languages
Proceedings of the Seventh Annual Structure in Complexity Theory Conference, Boston, Massachusetts, USA, June 22-25, 1992
Quantum versus Classical Proofs and Advice
Lower Bounds for Approximations by Low Degree Polynomials Over Z m
Dimension in Complexity Classes
Collapsing Oracle-Tape Hierarchies
A Strong Direct Sum Theorem for Distributional Query Complexity
The P-T-Degrees of the Recursive Sets: Lattice Embeddings, Extension of Embeddings and the Two Quantifier Theory
Improved Inapproximability of Lattice and Coding Problems with Preprocessing
Super Strong ETH Is True for PPSZ with Small Resolution Width
Collapse of the Hierarchy of Constant-Depth Exact Quantum Circuits
Multitask Efficiencies in the Decision Tree Model
Share Conversion and Private Information Retrieval
Symmetry-Assisted Adversaries for Quantum State Generation
Computing Functions with Parallel Queries to NP
The Power of Negative Reasoning
Decoding Concatenated Codes using Soft Information
A Small Span Theorem for P/Poly-Turing Reductions
Algebraic Dependencies and PSPACE Algorithms in Approximative Complexity
Near-Optimal Lower Bounds on the Multi-Party Communication Complexity of Set Disjointness
An Exponential Lower Bound on the Size of Constant-Depth Threshold Circuits with Small Energy Complexity
Limits on Representing Boolean Functions by Linear Combinations of Simple Functions: Thresholds, ReLUs, and Low-Degree Polynomials
Toward Better Depth Lower Bounds: The XOR-KRW Conjecture
A Generic Time Hierarchy for Semantic Models with One Bit of Advice
Hardness of KT Characterizes Parallel Cryptography
Errata for On the Power of Multi-Prover Interactive Protocols
Query Order and NP-Completeness
On p-Group Isomorphism: Search-To-Decision, Counting-To-Decision, and Nilpotency Class Reductions via Tensors
Finite Limits and Monotone Computations: The Lower Bounds Criterion
The Satisfiability Problem for Probabilistic Ordered Branching Programs
The Boolean Hierarchy: Hardware over NP
Non-deterministic Communication Complexity with Few Witness
On uniformity within NC 1
New Characterizations in Turnstile Streams with Applications
Logical Definability of Counting Functions
Random Restrictions and PRGs for PTFs in Gaussian Space
Exponentially Small Soundness for the Direct Product Z-Test
Lower Bounds on Query Complexity for Testing Bounded-Degree CSPs
Complexity of k-SAT
Fourier Concentration from Shrinkage
Optimal Lower Bounds for Matching and Vertex Cover in Dynamic Graph Streams
On the Power of Generalized MOD-Classes
Minimization of Decision Trees Is Hard to Approximate
Quantum Arthur-Merlin Games
Amplifying Circuit Lower Bounds against Polynomial Time with Applications
New Hardness Results for the Permanent Using Linear Optics
Counting Quantifiers, Successor Relations, and Logarithmic Space
Algorithmic Derandomization via Complexity Theory
A Quadratic Lower Bound for Algebraic Branching Programs
Turing Machines with few Accepting Computations and low Sets for PP
Finding Small Satisfying Assignments Faster Than Brute Force: A Fine-Grained Perspective into Boolean Constraint Satisfaction
Verifiable Stream Computation and Arthur-Merlin Communication
UG-Hardness to NP-Hardness by Losing Half
An Algorithmic Approach to Uniform Lower Bounds
On the Average-Case Complexity of MCSP and Its Variants
Hitting Sets and Reconstruction for Dense Orbits in VP_{e} and ΣΠΣ Circuits
On Read-Once vs. Multiple Access to Randomness in Logspace
The Complexity Types of Computable Sets
A Tight Lower Bound for Entropy Flattening
Nondeterministic Circuit Lower Bounds from Mildly De-randomizing Arthur-Merlin Games
On the Complexity of Evaluating Highest Weight Vectors
Nondeterministic Polynomial Time versus Nondeterministic Logarithmic Space: Time-Space Tradeoffs for Satisfiability
Towards Optimal Depth-Reductions for Algebraic Formulas
Universal Relations
Simple Affine Extractors Using Dimension Expansion
Reductions between Disjoint NP-Pairs
Almost Optimal Distribution-Free Junta Testing
Lower bounds for predecessor searching in the cell probe model
Composition Limits and Separating Examples for Some Boolean Function Complexity Measures
Distinguishing bounded reducibilities by sparse sets
Randomized Simultaneous Messages: Solution of a Problem of Yao in Communication Complexity
A Parallel Repetition Theorem for Entangled Projection Games
Bounded Oracles and Complexity Classes Inside Linear Space
Unifying Known Lower Bounds via Geometric Complexity Theory
Criticality of Regular Formulas
Separating Complexity Classes Using Structural Properties
Overlays and Limited Memory Communication
On Problems as Hard as CNF-SAT
Regularity, Boosting, and Efficiently Simulating Every High-Entropy Distribution
Translationally Invariant Constraint Optimization Problems
Derandomized Parallel Repetition Theorems for Free Games
Understanding Parallel Repetition Requires Understanding Foams
On the Usefulness of Predicates
Trade-Off Lower Bounds for Stack Machines
Two applications of complementation via inductive counting
Pseudorandom sources for BPP
On sets reducible to sparse sets
The Power of Unentanglement
On the Complexity of Diophantine Geometry in Low Dimensions (Abstract)
Compression of Samplable Sources
The Sum of d Small-Bias Generators Fools Polynomials of Degree d
On Arithmetic Branching Programs
Explicit Directional Affine Extractors and Improved Hardness for Linear Branching Programs
Weighted NP Optimization Problems: Logical Definability and Approximation Properties
Counting List Matrix Partitions of Graphs
Minimizing DNF Formulas and AC 0 d Circuits Given a Truth Table
Hardness of the Covering Radius Problem on Lattices
Holographic Proofs and Derandomization
On the Success Probability of the Two Provers in One-Round Proof Systems
Complexity Limitations on Quantum Computation
Tight SoS-Degree Bounds for Approximate Nash Equilibria
Combinatorics and Kolmogorov Complexity
The Isomorphism Conjecture Holds and One-Way Functions Exist Relative to an Oracle
On the Complexity of Some Problems on Groups Input as Multiplication Tables
On the Nonuniform Complexity on the Graph Isomorphism Problem
An Improved Protocol for the Exactly-N Problem
New Lower Bounds Against Homogeneous Non-Commutative Circuits
Low Influence Functions over Slices of the Boolean Hypercube Depend on Few Coordinates
With Probability One, A Random Oracle Separates PSPACE from the Polynomial- Time Hierarchy
New Extractors for Interleaved Sources
Composition is Almost as Good as S-1-1
Colourful TFNP and Propositional Proofs
On the Complexity of Hardness Amplification
A Dual Version of Reimer's Inequality and a Proof of Rudich's Conjecture
On the Complexity of Branching Proofs
Search Problems in Algebraic Complexity, GCT, and Hardness of Generators for Invariant Rings
Towards the Classical Communication Complexity of Entanglement Distillation Protocols with Incomplete Information
35th Computational Complexity Conference, CCC 2020, Saarbrücken, Germany (Virtual Conference), July 28-31, 2020
Quantum LDPC Codes of Almost Linear Distance via Iterated Homological Products
Gap MCSP Is Not (Levin) NP-Complete in Obfustopia
Parallel Repetition of Two Prover Games (Invited Survey)
Reversible Space Equals Deterministic Space
On the Resource Bounded Measure of P/poly
Computational Depth
Cicuits, Matrices, and Nonassociative Computation
The Complexity of Optimal Queueing Network Control
Complete Derandomization of Identity Testing and Reconstruction of Read-Once Formulas
Parallel Repetition for Entangled k-player Games via Fast Quantum Search
Online Condensing of Unpredictable Sources via Random Walks
Testing Linearity against Non-Signaling Strategies
Two decades of applied Kolmogorov complexity: in memoriam Andrei Nikolaevich Kolmogorov 1903-87
Constructive Separation of Classes of Indistinguishable Ensembles
31st Conference on Computational Complexity, CCC 2016, Tokyo, Japan, May 29 - June 1, 2016
An Exponential Lower Bound for Homogeneous Depth-5 Circuits over Finite Fields
Strengths and Weaknesses of Quantum Fingerprinting
Bounded Query Functions with Limited Output Bits
Oracles Are Subtle But Not Malicious
Better Lower Bounds for Locally Decodable Codes
Hierarchies of Circuit Classes that are Closed under Complement
Quantum Lower Bounds for Approximate Counting via Laurent Polynomials
Reconstruction of Generalized Depth-3 Arithmetic Circuits with Bounded Top Fan-in
The Optimal Depth of Variational Quantum Algorithms Is QCMA-Hard to Approximate
Linear-Algebraic List Decoding of Folded Reed-Solomon Codes
Isomorphisms of NP Complete Problems on Random Instances
Gaussian Noise Sensitivity and Fourier Tails
Counting Martingales for Measure and Dimension in Complexity Classes
Limitations of Quantum Advice and One-Way Communication
On the Non-Approximability of Boolean Functions by OBDDs and Read-K-Times Branching Programs
Limitations of Lower-Bound Methods for the Wire Complexity of Boolean Operators
Reconstruction of Depth 3 Arithmetic Circuits with Top Fan-In 3
33rd Computational Complexity Conference, CCC 2018, San Diego, CA, USA, June 22-24, 2018
Undecidability Results for Low Complexity Degree Structures
Reducibility Among Combinatorial Problems
Quantum Algorithmic Entropy
Extracting Quantum Entanglement
Grid Graph Reachability Problems
A Distribution Testing Oracle Separating QMA and QCMA
Hardness Amplification for Real-Valued Functions
A Super-Quadratic Lower Bound for Depth Four Arithmetic Circuits
Interactive Oracle Proofs of Proximity to Algebraic Geometry Codes
Combinatorial PCPs with Short Proofs
P NP [log n] and sparse turing complete sets for NP
Resource-Bounded Measure
A Superpolynomial Lower Bound on the Size of Uniform Non-constant-depth Threshold Circuits for the Permanent
On the theory of the PTIME degrees of the recursive sets
On Constructing Parallel Pseudorandom Generators from One-Way Functions
Improved Learning from Kolmogorov Complexity
Complete Problems for Promise Classes by Optimal Proof Systems for Test Sets
High-Dimensional Expanders from Chevalley Groups
Abelian Permutation Group Problems and Logspace Counting Classes
Lower Bounds for Constant Query Affine-Invariant LCCs and LTCs
Adaptivity Helps for Testing Juntas
Algorithms for Group Isomorphism via Group Extensions and Cohomology
Bounded Nondeterminism and Alternation in Parameterized Complexity Theory
A Complexity Theory for Feasible Closure Properties
Simple Proofs of Lower Bounds for Polynomial Evaluation
Weak Derandomization of Weak Algorithms: Explicit Versions of Yao's Lemma
A Dichotomy for Real Weighted Holant Problems
Algorithms for Circuits and Circuits for Algorithms
Optimality of Linear Sketching Under Modular Updates
Matrix Multiplication and Number on the Forehead Communication
Lower Bounds for Testing Bipartiteness in Dense Graphs
Universal Arguments and their Applications
The complexity of perfect zero-knowledge
Streaming Computation of Combinatorial Objects
Fooling Functions of Halfspaces under Product Distributions
Separating NP-Completeness Notions under Strong Hypotheses
Proceedings of the 26th Annual IEEE Conference on Computational Complexity, CCC 2011, San Jose, California, USA, June 8-10, 2011
In Search of an Easy Witness: Exponential Time vs. Probabilistic Polynomial Time
Functional Characterizations of Uniform Log-depth and Polylog-depth Circuit Families
On the Complexity of Intersecting Finite State Automata
Bounded Color Multiplicity Graph Isomorphism is in the #L Hierarchy
New Bounds for the Language Compression Problem
Time-Space Lower Bounds for SAT on Uniform and Non-Uniform Machines
Counting Classes Are at Least as Hard as the Polynomial-Time Hierarchy
20th Annual IEEE Conference on Computational Complexity (CCC 2005), 11-15 June 2005, San Jose, CA, USA
One-Way Functions, Hard on Average Problems, and Statistical Zero-Knowledge Proofs
Some Results on Majority Quantifiers over Words
The Composition Complexity of Majority
On the Structure of Low Sets
The complexity of ranking
On Rigid Matrices and U-polynomials
Imperfect Gaps in Gap-ETH and PCPs
Hardness of Max-2Lin and Max-3Lin over Integers, Reals, and Large Cyclic Groups
Symmetry of Information and Bounds on Nonuniform Randomness Extraction via Kolmogorov Extractors
Space Complexity in Polynomial Calculus
List Decoding with Side Information
Linear-Size Boolean Circuits for Multiselection
The Complexity World below Logarithmic Space
Limits of Minimum Circuit Size Problem as Oracle
Improved Approximation of Linear Threshold Functions
If NP Languages are Hard on the Worst-Case Then It is Easy to Find Their Hard Instances
On One-Way Functions from NP-Complete Problems
Barriers for Fast Matrix Multiplication from Irreversibility
A Depth- Size Tradeoff for Boolean Circuits with Unbounded Fan- In
Symmetry of Information from Meta-Complexity
P-Selective Self-reducibles Sets: A New Characterization of P
The List-Decoding Size of Fourier-Sparse Boolean Functions
Size-Degree Trade-Offs for Sums-of-Squares and Positivstellensatz Proofs
On the Power of Randomized Reductions and the Checkability of SAT
Affine Projections of Symmetric Polynomials
Resource-Bounded Genericity
The Complexity of Verifying the Characteristic Polynomial and Testing Similarity
Parallel Approximation of Min-max Problems with Applications to Classical and Quantum Zero-Sum Games
Tight Lower Bounds for Certain Parameterized NP-Hard Problems
An Exponential Separation Between Quantum Query Complexity and the Polynomial Degree
Some Connections Between Bounded Query Classes and Non-Uniform Complexity
SPARSE reduces conjunctively to TALLY
Permuting Information in Idealized Two-Level Storage
The Quantum Moment Problem and Bounds on Entangled Multi-prover Games
The Complexity of Solving Equations over Finite Groups
Characterizing the Distinguishability of Product Distributions Through Multicalibration
Hitting Sets for Regular Branching Programs
Monotone Separation of Logspace from NC
Error Reduction for Weighted PRGs Against Read Once Branching Programs
Algebraic Pseudorandomness in VNC⁰
Circuits Over PP and PL
The Complexity of Malign Ensembles
Quantum Copy-Protection and Quantum Money
Deterministic Amplification of Space-Bounded Probabilistic Algorithms