yusuke1997/dblp-id-title huggingface dataset:
Combining Interval Type-2 Fuzzy Clustering Method with Preprocessing Model for High-Resolution Remote Sensing Images
Air Quality Prediction Method Based On Integrating Grey Model And Neural Network Model
Cattle Body Size Measurement System Based on Dual-Position Cameras
Research On Palmprint Recognition Based On Mechanism And Data
Multi-view Contrastive Learning for Event Reconstruction in Dissemination of information
Research on the Extraction Method of Mining Car Point Set in Open Pit Mining Based on Machine Learning Algorithm
More Realistic 3D Environment Reconstruction from Scanned Data Based on Multi-process Technologies
A Vehicle Behavior Prediction Method Based on CNN-Transformer Model
Reconstruction-Guided Multi-Stage Network For MRI Super-Resolution
Enhanced Time Series Prediction with VMD: A Hybrid Deep Learning Approach
Research on Road Unexpected Obstacle Segmentation Algorithm Based on Improved RFB Deeplabv3+
Boosting Efficiency and Scalability of Multi-Agent Reinforcement Learning via Graph-Invariant Network
Research on Visual Navigation Technology of Citrus Orchard Based on Improved DeepLabv3+ Model
Fault diagnosis of chemical process based on CNN-BiGRU
Self-augmented modeling surface appearance based on ResNet
Infrared Spectral Deconvolution Algorithm Based on Masked Pre-training Transformer
Intelligent maintenance of disassembly production line
Optimization Calculation of Medical Staining Process Based on Autostainer
Sewer-MoE: A tuned Mixture of Experts Model for Sewer Defect Classification
A Lightweight Apple Fruit Instance Segmentation Network: YOLO-AppleSeg
A CNN-BiLSTM Method Based on Attention Mechanism for Class-imbalanced Abnormal Traffic Detection
Multi-scale Semantic Information Refinement and Hybrid Dual Attention Module based Object Detection in Remote Sensing Images
A Biased Non-Convex Optimization Algorithm based on Alternating Direction Method of Multipliers
A High Precision Reconstruction Method of Point Cloud for Three-dimensional Radar Imaging
Generating Image Adversarial Example by Modifying JPEG Stream
TransFuseNetS: A new Image Medical Segmentation Method based on TransFuse Architecture
Animal Fiber Detection Based on Image Recognition Techniques
A Novel Fusion Network for Apple Image Classification and Quantity Recognition
A Real-Time Viewpoint Rendering System Based on Multi-Plane Images and Neural Radiance Fields
Underwater image enhancement method through color correction and guide image filtering
Machine Learning Model for Predicting Risk of Primary Sj?gren's syndrome using N7-methylguanosine-related Genes
Deep Learning-Enabled Non-convex Optimization: Encoder-Decoder Forecasting and ADMM Solver
A Bregman Inertial Relaxed Forward-Backward Method for Nonconvex Minimization Problems
Confidence Graph Learning for Incomplete Multi-View Clustering
VA-Net: 3D Object Detection with 4D Radar Based on Self-Attention
MiT: Land Parcel Segmentation Mask in Tokens
Skeleton Action Recognition Based on Autocorrelation Guidance and Segment Sequence
Mining Temporal Moving Patterns in Object Tracking Sensor Networks
An Efficient Protocol for Disseminating Consistent Data in Broadcast Environments
Finding Periodic Outliers over a Monogenetic Event Stream
Context Awareness: a Practitioner's Perspective
Ubiquitous Data Management in Knowledge Sifter via Data-DNA
Context for Ubiquitous Data Management
Context-based Preference Analysis Method in Ubiquitous Commerce
Implementing BDFS(b) with Diff-Sets for Real-Time Frequent Pattern Mining in Dense Datasets - First Findings
A Ubiquitous Photo Mapping Considering Users' Lines of Sight
Somebody, Sometime, Somewhere, Something
2005 International Workshop on Ubiquitous Data Management (UDM 2005), 4 April 2005, Tokyo, Japan
The Role of Context for Information Mediation
Wireless Sensor Networks: From Data to Context to Energy Saving
A Ubiquitous Computing Environment Composed by Cooperation between Visual Markers and Event-Driven Compact Devices
Challenges and Opportunities of Context-Aware Information Access
Message from the Program Committee Chair
Solving Unique Games over Globally Hypercontractive Graphs
A Depth-Five Lower Bound for Iterated Matrix Multiplication
Strong Locally Testable Codes with Relaxed Local Decoders
The Complexity of Circuit Value and Network Stability
Time-Space Tradeoffs for Nondeterministic Computation
Halfspace Matrices
On the Sum-of-Squares Degree of Symmetric Quadratic Functions
Proceedings of the Tenth Annual Structure in Complexity Theory Conference, Minneapolis, Minnesota, USA, June 19-22, 1995
Juris Hartmanis: building a department-building a discipline
Inverting Onto Functions
Circuits with Medium Fan-In
Random Resolution Refutations
Two-Player Entangled Games are NP-Hard
Gaps in Bounded Query Hierarchies
Non-malleable Extractors with Short Seeds and Applications to Privacy Amplification
Isolation, Matching, and Counting
Proceedings of the 25th Annual IEEE Conference on Computational Complexity, CCC 2010, Cambridge, Massachusetts, USA, June 9-12, 2010
On Modular Counting with Polynomials
On One Query Self-Reducible Sets
Direct Product Testing
Pseudorandomness, Symmetry, Smoothing: I
Influence in Completely Bounded Block-Multilinear Forms and Classical Simulation of Quantum Algorithms
Logspace self-reducibility
Extracting Randomness: How and Why A survey
Easiness Amplification and Uniform Circuit Lower Bounds
BPL ⊆ L-AC¹
Harmonicity and Invariance on Slices of the Boolean Cube
Average-Case Lower Bounds and Satisfiability Algorithms for Small Threshold Circuits
Pseudorandomness of Expander Random Walks for Symmetric Functions and Permutation Branching Programs
Resolution Lower Bounds for Perfect Matching Principles
A Direct Product Theorem for Discrepancy
On the Unique Games Conjecture (Invited Survey)
19th Annual IEEE Conference on Computational Complexity (CCC 2004), 21-24 June 2004, Amherst, MA, USA
Decision trees and downward closures
Approaching the Chasm at Depth Four
A Lower Bound for Polynomial Calculus with Extension Rule
On Parameterized Path and Chordless Path Problems
BP(L(f) 1+epsilon )
Lower Bounds for Testing Function Isomorphism
Communication Complexity and Information Complexity: Foundations and New Directions
Probabilistic Martingales and BPTIME Classes
Completely Inapproximable Monotone and Antimonotone Parameterized Problems
On Coherence, Random-self-reducibility, and Self-correction
What Is a Hard Instance of a Computational Problem?
Complexity Lower Bounds for Computing the Approximately-Commuting Operator Value of Non-Local Games to High Precision
Distinguishing SAT from Polynomial-Size Circuits, through Black-Box Queries
A Generalized Method for Proving Polynomial Calculus Degree Lower Bounds
On the Degree of Polynomials Computing Square Roots Mod p
Non-Malleable Extractors and Non-Malleable Codes: Partially Optimal Constructions
A Log-Space Algorithm for Reachability in Planar Acyclic Digraphs with Few Sources
On Non- uniform Polynomial Space
Testing List H-homomorphisms
Space Complexity of Random Formulae in Resolution
Quantum Money with Classical Verification
Bounded Queries and the NP Machine Hypothesis
Logspace and Logtime Leaf Languages
Small Spans in Scaled Dimension
Reducing P to a Sparse Set using a Constant Number of Queries Collapses P to L
Derandomization with Minimal Memory Footprint
On Pseudoentropy versus Compressibility
Complexity theoretic algebra I - vector spaces over finite fields
Front Matter, Table of Contents, Preface, Awards, Conference Organization, External Reviewers
On the Lattice Smoothing Parameter Problem
Zero Knowledge and the Chromatic Number
An Isomorphism between Subexponential and Parameterized Complexity Theory
A Personal View of Average-Case Complexity
NP-Hard Sets Are Exponentially Dense Unless coNP C NP/poly
Approximating Boolean Functions with Depth-2 Circuits
On the Complexity of Integer Multiplication in Branching Programs with Multiple Tests and in Read-Once Branching Programs with Limited Nondeterminism
Reordering Rule Makes OBDD Proof Systems Stronger
Finitary Substructure Languages
On the Complexity of the Cayley Semigroup Membership Problem
Formulas are Exponentially Stronger than Monotone Circuits in Non-commutative Setting
A Lower Bound on Determinantal Complexity
Circuit Bottom Fan-in and Computational Power
Dimension Reduction for Polynomials over Gaussian Space and Applications
Multiparty Quantum Coin Flipping
A Stronger Kolmogorov Zero-One Law for Resource-Bounded Measure
Worst-Case Running Times for Average-Case Algorithms
Structure in Complexity Theory, Proceedings of the Conference hold at the University of California, Berkeley, California, USA, June 2-5, 1986
Hardness of Approximation for Stochastic Problems via Interactive Oracle Proofs
Nondeterministic Witnesses and Nonuniform Advice
Collapsing Degrees in Subexponential Time
New Lower Bounds for Vertex Cover in the Lovasz-Schrijver Hierarchy
The Power of Local Self-Reductions
Derandomizing Arthur-Merlin Games and Approximate Counting Implies Exponential-Size Lower Bounds
A Note on the Shortest Lattice Vector Problem
Barriers for Recent Methods in Geodesic Optimization
Lower Bounds on Representing Boolean Functions as Polynomials in Z m
Shadows of Newton Polytopes
The Polynomial Hierarchy and Intuitionistic Bounded Arithmetic
Better Time-Space Lower Bounds for SAT and Related Problems
L-Printable Sets
Counting auxiliary pushdown automata and semi-unbounded arithmetic circuits
A Lower Bound for Primality
Strong ETH Breaks With Merlin and Arthur: Short Non-Interactive Proofs of Batch Evaluation
A Note on Relativizing Complexity Classes with Tally Oracles
P-Productivity and Polynominal Time Approximations
Hard Submatrices for Non-Negative Rank and Communication Complexity
Quantifiers and Approximation (Abstract)
Space-Bounded Quantum Interactive Proof Systems
Proceedings of the Second Annual Conference on Structure in Complexity Theory, Cornell University, Ithaca, New York, USA, June 16-19, 1987
Circuit Size Relative to Pseudorandom Oracles
On Derandomizing Probabilistic Sublinear-Time Algorithms
Lower Bounds on Quantum Multiparty Communication Complexity
Towards Proving Strong Direct Product Theorems
PPSZ for General k-SAT - Making Hertli's Analysis Simpler and 3-SAT Faster
A Separation of Determinism, Las Vegas and Nondeterminism for Picture Recognition
Space bounded probabilistic game automata
Isomorphism of Planar Graphs
Near-Optimal and Explicit Bell Inequality Violations
The Complexity Of The Real Line Is A Fractal
Cook is faster than Karp: a study of reducibilities in NP
Linear Systems over Finite Abelian Groups
Identity Testing for Constant-Width, and Commutative, Read-Once Oblivious ABPs
Information Dissemination via Broadcasts in the Presence of Adversarial Noise
Explicit Dimension Reduction and Its Applications
On the Power of Symmetric LP and SDP Relaxations
A Ihara-Bass Formula for Non-Boolean Matrices and Strong Refutations of Random CSPs
Semantics versus Syntax versus Computations
Approximable Sets
Hard Sets are Hard to Find
Multiparty Karchmer - Wigderson Games and Threshold Circuits
An Adaptivity Hierarchy Theorem for Property Testing
A Sublinear Space, Polynomial Time Algorithm for Directed s-t Connectivity
The complexity of stochastic sequences
Stochasticity in Algorithmic Statistics for Polynomial Time
On Monotone Planar Circuits
Understanding PPA-Completeness
Uniform hardness vs. randomness tradeoffs for Arthur-Merlin games
Reducing Tarski to Unique Tarski (In the Black-Box Model)
Error Reduction by Parallel Repetition - a Negative Result
The Program-Enumeration Bottleneck in Average-Case Complexity Theory
On Physical Problems that are Slightly More Difficult than QMA
Time-Space Tradeoffs for Counting NP Solutions Modulo Integers
Polynomial Isomorphism of 1-L-Complete Sets
k-Subgraph Isomorphism on AC 0 Circuits
39th Computational Complexity Conference, CCC 2024, Ann Arbor, MI, USA, July 22-25, 2024
Memoization and DPLL: Formula Caching Proof Systems
Resolution Width-Size Trade-offs for the Pigeon-Hole Principle
Much Ado about Functions
Simple and Efficient Pseudorandom Generators from Gaussian Processes
Pseudorandom Generators, Resolution and Heavy Width
Distribution-Free Proofs of Proximity
On Proving Lower Bounds for Circuit Size
Polynomial Time Truth-Table Reductions to P-Selective Sets
On the Monte Carlo Boolean Decision Tree Complexity of Read-Once Formulae
New Results on Noncommutative and Commutative Polynomial Identity Testing
On the Power of Number-Theoretic Operations with Respect to Counting
Pseudorandomness When the Odds are Against You
On Query-To-Communication Lifting for Adversary Bounds
Prospects for Geometric Complexity Theory
Tight Correlation Bounds for Circuits Between AC0 and TC0
A Pseudorandom Oracle Characterization of BPP
Strong nondeterministic reduction - a technique for proving intractability
Space-Efficient Algorithms for Reachability in Surface-Embedded Graphs
37th Computational Complexity Conference, CCC 2022, Philadelphia, PA, USA, July 20-23, 2022
On Monadic NP vs. Monadic co-NP (Extended Abstract)
two Lower Bound Arguments with "Inaccessible" Numbers
A Note on Genericity and Bi-Immunity
Towards Uncheatable benchmarks
Log-Seed Pseudorandom Generators via Iterated Restrictions
Circuit Lower Bounds from NP-Hardness of MCSP Under Turing Reductions
New Near-Linear Time Decodable Codes Closer to the GV Bound
Width-Bounded Reducibility and Binary Search over Complexity Classes
36th Computational Complexity Conference, CCC 2021, Toronto, Ontario, Canada (Virtual Conference), July 20-23, 2021
Noisy Interpolation of Sparse Polynomials, and Applications
Polynomial Bounds for Decoupling, with Applications
Towards a Reverse Newman's Theorem in Interactive Information Complexity
Succinct Representation, Leaf Languages, and Projection Reductions
On the Complexity of Boolean Functions in Different Characteristics
Geometric Arguments Yield Better Bounds for Threshold Circuits and Distributed Computing
Random Strings Make Hard Instances
Randomness, Relativizations, and Polynomial Reducibilities
Pseudodistributions That Beat All Pseudorandom Generators (Extended Abstract)
Comparing Notions of Full Derandomization
Lower Bounds for Polynomial Calculus with Extension Variables over Finite Fields
On the Power of Unique 2-Prover 1-Round Games
On Efficient Noncommutative Polynomial Factorization via Higman Linearization
Local Enumeration and Majority Lower Bounds
Complexity Classes with Advice
Lower Bounds for Depth Three Arithmetic Circuits with Small Bottom Fanin
Relationships Between Quantum and Classical Space-Bounded Complexity Classes
Detecting Rational Points on Hypersurfaces over Finite Fields
Hardness vs. Randomness within Alternating Time
Intractability of Read-Once Resolution
The Computational Advantage of MIP^∗ Vanishes in the Presence of Noise
The Communication Complexity of the Universal Relation
Taking it to the Limit: On Infinite Variants of NP-Complete Problems
On the Theory of Matchgate Computations
Optimal Error Pseudodistributions for Read-Once Branching Programs
Complements of Multivalued Functions
The power of counting
Fourier Growth of Parity Decision Trees
Extracting the Mutual Information for a Triple of Binary Strings
Parallel Approximation of Non-interactive Zero-sum Quantum Games
Depth-d Frege Systems Are Not Automatable Unless P = NP
On Superlinear Lower Bounds in Complexity Theory
Toward a Model for Backtracking and Dynamic Programming
On Completeness under Random Reductions
A Time-Distance Trade-Off for GDD with Preprocessing - Instantiating the DLW Heuristic
Superlinear Lower Bounds for Multipass Graph Processing
An oracle characterization of the counting hierarchy
Tensor Rank: Some Lower and Upper Bounds
Algebraic Branching Programs, Border Complexity, and Tangent Spaces
Norms, XOR Lemmas, and Lower Bounds for GF(2) Polynomials and Multiparty Protocols
Almost Polynomial Factor Inapproximability for Parameterized k-Clique
Derandomization of Probabilistic Auxiliary Pushdown Automata Classes
Vanishing Spaces of Random Sets and Applications to Reed-Muller Codes
Structural Properties of Nondeterministic Complete Sets
Toward a Lower Bound for Sorting Networks
Arithmetic Circuit Complexity of Division and Truncation
Uniformly Hard Languages
Honest polynomial reducibilities, recursively enumerable sets, and the P=?NP problem
Models of Computation in Coding Theory
The Polynomial Method in Circuit Complexity
Rapid Mixing
Trade-Offs Between Entanglement and Communication
The Complexity of Approximating the Entropy
The Learning with Errors Problem (Invited Survey)
Complexity characterizations of attribute grammar languages
Lower Bounds on Random-Self-Reducibility
Inapproximability of Vertex Cover and Independent Set in Bounded Degree Graphs
New Sampling Lower Bounds via the Separator
Towards Uniform AC 0 - Isomorphisms
A structural theorem that depends quantitatively on the complexity of SAT
The Approximate Degree of Bipartite Perfect Matching
A Note on Universal Distributions for Polynomial-Time Computable Distributions
On the Power of Polynomial Time Bit-Reductions (Extended Abstract)
Polynomial Vicinity Circuits and Nonlinear Lower Bounds
Witness Encryption and NP-Hardness of Learning
Paris-Harrington Tautologies
Connections between the Complexity of Unique Satisfiability and the Threshold Behavior of Randomized Reductions
Language Compression and Pseudorandom Generators
Invariance Principle on the Slice
Criticality of AC⁰-Formulae
Super-logarithmic Depth Lower Bounds via Direct Sum in Communication Coplexity
Degree and Sensitivity: Tails of Two Distributions
A Lower Bound for the Shortest Path Problem
Near-Optimal Set-Multilinear Formula Lower Bounds
Geometric Rank of Tensors and Subrank of Matrix Multiplication
Optimizing TRIEs for Ordered Pattern Matching is Pi P 2 -Complete
Hardness Amplification within NP
The Density of Weakly Complete Problems under Adaptive Reductions
Relationless Completeness and Separations
Complexity of Robust Orbit Problems for Torus Actions and the abc-Conjecture
Inequalities for Shannon entropies and Kolmogorov complexities
A Strong Inapproximability Gap for a Generalization of Minimum Bisection
Quantum Bounded Query Complexity
Optimal Approximations of Complete Sets
Schur Polynomials Do Not Have Small Formulas If the Determinant Doesn't
Separating Quantum Communication and Approximate Rank
Unambiguous Polynomial Hierarchies and Exponential Size
Search-To-Decision Reductions for Kolmogorov Complexity
The Complexity of Tensor Calculus
Efficient Batch Verification for UP
The Complexity of Treelike Systems over lamda-Local Formulae
On the power of multi-power interactive protocols
The Computational Complexity of Iterative Methods for Systems of Nonlinear Equations
Easiness Assumptions and Hardness Tests: Trading Time for Zero Error
Graph Colouring is Hard for Algorithms Based on Hilbert's Nullstellensatz and Gröbner Bases
On the Matching Problem for Special Graph Classes
On the Relativized Power of Additional Accepting Paths
On the Complexity of Quantum ACC
Towards Average-Case Complexity Analysis of NP Optimization Problems
An Optimal Lower Bound for Turing Machines with One Work Tape and a Two- way Input Tape
Random Debaters and the Hardness of Approximating Stochastic Functions
Exponential Separation of Quantum and Classical Non-interactive Multi-party Communication Complexity
On Honest Polynomial Reductions, Relativizations, and P=NP
A Lower Bound for Perceptrons and an Oracle Separation of the PP PH Hierarchy
Approximability of the Eight-Vertex Model
Nonclassical Polynomials as a Barrier to Polynomial Lower Bounds
Approximating the SVP to within a Factor is NP-Hard under Randomized Reductions
On the Minimal Fourier Degree of Symmetric Boolean Functions
Weakly Hard Problems
Sum of Squares Bounds for the Ordering Principle
Sign Rank vs Discrepancy
Variety Evasive Subspace Families
Probabilistic Kolmogorov Complexity with Applications to Average-Case Complexity
Randomness Conductors and Constant-Degree Lossless Expanders
Non-Commutative Formulas and Frege Lower Bounds: a New Characterization of Propositional Proofs
Relativized Separations of Worst-Case and Average-Case Complexities for NP
The Hardness of Being Private
Formal Power Series: An Algebraic Approach to the GapP and #P Functions
A Note on the Bottleneck Counting Argument
On the Sum of Square Roots of Polynomials and Related Problems
Proofs of Membership vs. Proofs of Knowledge
Representations of Monotone Boolean Functions by Linear Programs
On the Cut Dimension of a Graph
Pseudorandom Generators for Combinatorial Checkerboards
Improved Bounds for Quantified Derandomization of Constant-Depth Circuits and Polynomials
A Survey of Optimal PCP Characterizations of NP
No Strong Parallel Repetition with Entangled and Non-signaling Provers
A Geometric Approach to Information-Theoretic Private Information Retrieval
Extremal properties of polynomial threshold functions
On Heuristic Time Hierarchies
Self-Reducible, P-Selectlve, Near-Testable, Near-Testable, and P-Cheatable Sets: The Effect of Internal Structure on the Complexity of a Set
Generative Models of Huge Objects
Rate Amplification and Query-Efficient Distance Amplification for Linear LCC and LDC
Results on Communication Complexity Classes
Arthur and Merlin in a Quantum World
Parameterized Complexity of Constraint Satisfaction Problems
Hardness of Bounded Distance Decoding on Lattices in ℓ p Norms
Characterization of Non-Deterministic Quantum Query and Quantum Communication Complexity
On Operators of Higher Types
A Fine-Grained Analogue of Schaefer's Theorem in P: Dichotomy of Exists^k-Forall-Quantified First-Order Graph Properties
Separation Results for Bounded Alternation
Short Proofs Are Narrow - Resolution Made Simple (Abstract)
Hyper-Polynomial Hierarchies and the NP-Jump
A Note on the Instance Complexity of Pseudorandom Sets
On the Quantum Complexity of Closest Pair and Related Problems
On the Communication Complexity of Read-Once AC^0 Formulae
Relating Equivalence and Reducibility to Sparse Sets
Depth-3 Arithmetic Formulae over Fields of Characteristic Zero
Constraint Logic: A Uniform Framework for Modeling Computation as Games
Superlinear Lower Bounds for Bounded-Width Branching Programs
On the Theory of Average Case Complexity (abstract)
Hardness of Finding Independent Sets in 2-Colorable Hypergraphs and of Satisfiable CSPs
Identity Testing and Lower Bounds for Read-k Oblivious Algebraic Branching Programs
Generalized Tsirelson Inequalities, Commuting-Operator Provers, and Multi-prover Interactive Proof Systems
Every Permutation CSP of arity 3 is Approximation Resistant
Multiplicative Extractors for Samplable Distributions
Pseudorandom Bits for Constant Depth Circuits with Few Arbitrary Symmetric Gates
One- Way Functions and Circuit Complexity
How to Construct Random Strings
Quantum Certificate Complexity
Narrow Proofs May Be Maximally Long
Proceedings of the Ninth Annual Structure in Complexity Theory Conference, Amsterdam, The Netherlands, June 28 - July 1, 1994
Lifting Dichotomies
On Languages with Very High Information Content
Stronger Separations for Random-Self-Reducibility, Rounds, and Advice
Quantum Algorithms for Element Distinctness
Near-Optimal Erasure List-Decodable Codes
Nearly Optimal Separations Between Communication (or Query) Complexity and Partitions
DNF Sparsification and a Faster Deterministic Counting Algorithm
Efficiency of Equivalence Algorithms
Some Structural Complexity Aspects of Neural Computation
Quantum versus Classical Learnability
The Inapproximability of Lattice and Coding Problems with Preprocessing
Quantum Complexity of Minimum Cut
Kolmogorov complexity and degrees of tally sets
Deciding the Vapnik-Cervonenkis dimension is Sigma P 3 -complete
Quantum Kolmogorov Complexity
Polylogarithmic-Round Interactive Proofs for coNP Collapse the Exponential Hierarchy
The History of Complexity
Hitting Sets Give Two-Sided Derandomization of Small Space
Finding Missing Items Requires Strong Forms of Randomness
On the Fourier Spectrum of Symmetric Boolean Functions with Applications to Learning Symmetric Juntas
Improved Cryptographic Hash Functions with Worst-Case/Average-Case Connection
A Characterization of Hard-to-cover CSPs
A Derandomized Switching Lemma and an Improved Derandomization of AC0
Privacy, Additional Information, and Communication