Imagen de Portada

Nearest Neighbor Complexity and Boolean Circuits

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	DiCicco, Mason, Podolskii, Vladimir, Reichman, Daniel
Formato:	Preprint
Publicado:	2024
Materias:	Computational Complexity
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

One-Way Communication Complexity of Partial XOR Functions
por: Podolskii, Vladimir V., et al.
Publicado: (2023)

Complexity Aspects of the Extension of Wagner's Hierarchy to $k$-Partitions
por: Podolskii, Vladimir, et al.
Publicado: (2024)

Nearest Neighbor Representations of Neural Circuits
por: Kilic, Kordag Mehmet, et al.
Publicado: (2024)

Boolean Circuit Complexity and Two-Dimensional Cover Problems
por: Cavalar, Bruno P., et al.
Publicado: (2025)

Nearest Neighbor Representations of Neurons
por: Kilic, Kordag Mehmet, et al.
Publicado: (2024)

The Karp Dataset
por: DiCicco, Mason, et al.
Publicado: (2025)

Heuristics Optimization of Boolean Circuits with application in Attribute Based Encryption
por: Ionita, Alexandru, et al.
Publicado: (2023)

Range Avoidance in Boolean Circuits via Turan-type Bounds
por: Kuntewar, Neha, et al.
Publicado: (2025)

Complex Boolean Turing Machines: An Algebraic Semantic Framework for Computational Complexity
por: Zheng, Bojin, et al.
Publicado: (2026)

Nearest Neighbor CCP-Based Molecular Sequence Analysis
por: Ali, Sarwan, et al.
Publicado: (2024)

On the Complexity of Techniques That Make Transition Systems Implementable by Boolean Nets
por: Devillers, Raymond, et al.
Publicado: (2022)

The Computational Complexity of Counting Linear Regions in ReLU Neural Networks
por: Stargalla, Moritz, et al.
Publicado: (2025)

The Unit Gap: How Sharing Works in Boolean Circuits
por: Krinkin, Kirill
Publicado: (2026)

From Proof Complexity to Circuit Complexity via Interactive Protocols
por: Arteche, Noel, et al.
Publicado: (2024)

Improved Bounds on the Space Complexity of Circuit Evaluation
por: Shalunov, Yakov
Publicado: (2025)

Monotone Circuit Complexity of Matching
por: Cavalar, Bruno, et al.
Publicado: (2025)

Instance complexity of Boolean functions
por: Liu, Alison Hsiang-Hsuan, et al.
Publicado: (2023)

Query complexity of Boolean functions on the middle slice of the cube
por: Gerbner, Dániel, et al.
Publicado: (2023)

Complexity of Boolean automata networks under block-parallel update modes
por: Perrot, Kévin, et al.
Publicado: (2024)

Boolean Functions with Minimal Spectral Sensitivity
por: Prūsis, Krišjānis, et al.
Publicado: (2024)

Special Coverings of Sets and Boolean Functions
por: Margaryan, Stepan
Publicado: (2024)

The Algebraic Cost of a Boolean Sum
por: Orzel, Ian, et al.
Publicado: (2025)

On Boolean PCSPs with Polynomial Threshold Polymorphisms
por: Michno, Katzper
Publicado: (2025)

Inverse Intersections for Boolean Satisfiability Problems
por: Homer, Paul W.
Publicado: (2025)

Exponential-Size Circuit Complexity is Comeager in Symmetric Exponential Time
por: Hitchcock, John M.
Publicado: (2026)

Boolean PCSPs through the lens of Fourier Analysis
por: Banakh, Demian, et al.
Publicado: (2026)

PCP-free APX-Hardness of Nearest Codeword and Minimum Distance
por: Bhattiprolu, Vijay, et al.
Publicado: (2025)

Local Correction of Linear Functions over the Boolean Cube
por: Amireddy, Prashanth, et al.
Publicado: (2024)

Low Degree Local Correction Over the Boolean Cube
por: Amireddy, Prashanth, et al.
Publicado: (2024)

Conditional Complexity Hardness: Monotone Circuit Size, Matrix Rigidity, and Tensor Rank
por: Chukhin, Nikolai, et al.
Publicado: (2024)

On the Incompressibility of Truth With Application to Circuit Complexity
por: Tonon, Luke
Publicado: (2025)

The Randomized Query Complexity of Finding a Tarski Fixed Point on the Boolean Hypercube
por: Brânzei, Simina, et al.
Publicado: (2024)

Global Citizenship Education within a Context of Accountability and 21st Century Skills: The Case of Olympus High School
por: Marzia Cozzolino DiCicco
Publicado: (2016)

Boolean functions on high-dimensional expanders
por: Dikstein, Yotam, et al.
Publicado: (2018)

Symmetric Distributions from Shallow Circuits
por: Kane, Daniel M., et al.
Publicado: (2025)

New Algebrization Barriers to Circuit Lower Bounds via Communication Complexity of Missing-String
por: Chen, Lijie, et al.
Publicado: (2025)

Expected Shapley-Like Scores of Boolean Functions: Complexity and Applications to Probabilistic Databases
por: Karmakar, Pratik, et al.
Publicado: (2024)

Exact versus Approximate Representations of Boolean Functions in the De Morgan Basis
por: Chattopadhyay, Arkadev, et al.
Publicado: (2025)

A Near-Optimal Polynomial Distance Lemma Over Boolean Slices
por: Amireddy, Prashanth, et al.
Publicado: (2025)

The 2CNF Boolean Formula Satisfiability Problem and the Linear Space Hypothesis
por: Yamakami, Tomoyuki
Publicado: (2017)