:: Library Catalog

Image de couverture de livre

Enregistré dans:

Détails bibliographiques
Auteur principal:	Yamakami, Tomoyuki
Format:	Preprint
Publié:	2017
Sujets:	Computational Complexity
Accès en ligne:	https://arxiv.org/abs/1709.10453
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Quantum First-Order Logics That Capture Logarithmic-Time/Space Quantum Computability
par: Yamakami, Tomoyuki
Publié: (2025)

Complexity Classification of Complex-Weighted Counting Acyclic Constraint Satisfaction Problems
par: Yamakami, Tomoyuki
Publié: (2024)

Logical Expressibility of Syntactic NL for Complementarity, Monotonicity, and Maximization
par: Yamakami, Tomoyuki
Publié: (2024)

Between SC and LOGDCFL: Families of Languages Accepted by Logarithmic-Space Deterministic Auxiliary Depth-k Storage Automata
par: Yamakami, Tomoyuki
Publié: (2022)

Nonuniform Families of Polynomial-Size Quantum Finite Automata and Quantum Logarithmic-Space Computation with Polynomial-Size Advice
par: Yamakami, Tomoyuki
Publié: (2019)

Elementary Quantum Recursion Schemes That Capture Quantum Polylogarithmic Time Computability of Quantum Functions
par: Yamakami, Tomoyuki
Publié: (2023)

A Schematic Definition of Quantum Polynomial Time Computability
par: Yamakami, Tomoyuki
Publié: (2018)

Unambiguous and Co-Nondeterministic Computations of Finite Automata and Pushdown Automata Families and the Effects of Multiple Counters
par: Yamakami, Tomoyuki
Publié: (2024)

Power of Counting by Nonuniform Families of Polynomial-Size Finite Automata
par: Yamakami, Tomoyuki
Publié: (2023)

Intersection and Union Hierarchies of Deterministic Context-Free Languages and Pumping Lemmas
par: Yamakami, Tomoyuki
Publié: (2021)

The No Endmarker Theorem for One-Way Probabilistic Pushdown Automata
par: Yamakami, Tomoyuki
Publié: (2021)

Nondeterministic Auxiliary Depth-Bounded Storage Automata and Semi-Unbounded Fan-in Cascading Circuits
par: Yamakami, Tomoyuki
Publié: (2024)

Inverse Intersections for Boolean Satisfiability Problems
par: Homer, Paul W.
Publié: (2025)

How Does Adiabatic Quantum Computation Fit into Quantum Automata Theory?
par: Yamakami, Tomoyuki
Publié: (2020)

Compression with wildcards: All models of a Boolean 2-CNF
par: Wild, Marcel
Publié: (2012)

On the Satisfaction Probabilities of $k$-CNF Formulas
par: Tantau, Till
Publié: (2022)

Learning-Augmented Algorithms for Boolean Satisfiability
par: Attias, Idan, et autres
Publié: (2025)

Model Counting for Dependency Quantified Boolean Formulas
par: Fung, Long-Hin, et autres
Publié: (2025)

Hard CNF Instances for Ideal Proof Systems
par: Hakoniemi, Tuomas, et autres
Publié: (2026)

Solving Quantified Boolean Formulas with Few Existential Variables
par: Eriksson, Leif, et autres
Publié: (2024)

On Extremal Properties of k-CNF: Capturing Threshold Functions
par: Gurumukhani, Mohit, et autres
Publié: (2024)

Local Correction of Linear Functions over the Boolean Cube
par: Amireddy, Prashanth, et autres
Publié: (2024)

Boolean Circuit Complexity and Two-Dimensional Cover Problems
par: Cavalar, Bruno P., et autres
Publié: (2025)

Compilation and Fast Model Counting beyond CNF
par: de Colnet, Alexis, et autres
Publié: (2025)

Spectral Norm, Economical Sieve, and Linear Invariance Testing of Boolean Functions
par: Datta, Swarnalipa, et autres
Publié: (2023)

On Approximability of Satisfiable k-CSPs: V
par: Bhangale, Amey, et autres
Publié: (2024)

The Computational Complexity of Satisfiability in State Space Models
par: Alsmann, Eric, et autres
Publié: (2025)

On Approximability of Satisfiable $k$-CSPs: VI
par: Bhangale, Amey, et autres
Publié: (2024)

On Approximability of Satisfiable $k$-CSPs: VII
par: Bhangale, Amey, et autres
Publié: (2024)

On Approximability of Satisfiable k-CSPs: IV
par: Bhangale, Amey, et autres
Publié: (2023)

Ideal Membership Problem for Boolean Minority and Dual Discriminator
par: Bharathi, Arpitha P., et autres
Publié: (2024)

Instance complexity of Boolean functions
par: Liu, Alison Hsiang-Hsuan, et autres
Publié: (2023)

Gateways to Tractability for Satisfiability in Pearl's Causal Hierarchy
par: Ganian, Robert, et autres
Publié: (2025)

The Algebraic Cost of a Boolean Sum
par: Orzel, Ian, et autres
Publié: (2025)

Boolean Functions with Minimal Spectral Sensitivity
par: Prūsis, Krišjānis, et autres
Publié: (2024)

On Boolean PCSPs with Polynomial Threshold Polymorphisms
par: Michno, Katzper
Publié: (2025)

Special Coverings of Sets and Boolean Functions
par: Margaryan, Stepan
Publié: (2024)

Nearest Neighbor Complexity and Boolean Circuits
par: DiCicco, Mason, et autres
Publié: (2024)

Probabilistic and Causal Satisfiability: Constraining the Model
par: Bläser, Markus, et autres
Publié: (2025)

Boolean PCSPs through the lens of Fourier Analysis
par: Banakh, Demian, et autres
Publié: (2026)