Suchergebnisse - "Computer Science - Computational Complexity"

Quantifying over Boolean announcements von van Ditmarsch, Hans, French, Tim

“… The logic BAPAL is the subject of this work. Unlike APAL it has a finitary axiomatization. Also, BAPAL is not at least as expressive as APAL. A further claim that BAPAL is decidable is deferred to a companion paper …”
Volltext

Hardness results for decoding the surface code with Pauli noise von Fischer, Alex, Miyake, Akimasa

“… Real quantum computers will be subject to complicated, qubit-dependent noise, instead of simple noise such as depolarizing noise with the same strength for all qubits …”
Volltext

Quantum Advantage with Shallow Circuits Under Arbitrary Corruption von Hasegawa, Atsuya, François Le Gall

“… Using quantum error correction, Bravyi, Gosset, K\"onig and Tomamichel (Nature Physics 2020) further proved that a similar separation still persists even if quantum circuits are subject to local stochastic noise …”
Volltext

Quantifying over Boolean announcements von Hans van Ditmarsch, French, Tim

“… The logic BAPAL is the subject of this work. Unlike APAL it has a finitary axiomatization. Also, BAPAL is not at least as expressive as APAL. A further claim that BAPAL is decidable is deferred to a companion paper …”
Volltext

Limits of quantum speed-ups for computational geometry and other problems: Fine-grained complexity via quantum walks von Buhrman, Harry, Loff, Bruno, Patro, Subhasree, Speelman, Florian

“… Many computational problems are subject to a quantum speed-up: one might find that a problem having an O(n^3)-time or O(n^2 …”
Volltext

The Cook-Reckhow definition von Krajicek, Jan

“… There were earlier papers which contributed to the subject as we understand it today, the most significant being Tseitin's 1968 paper, but none of them introduced general notions that would allow …”
Volltext

(\mathcal{N}\)IPM-HLSP: An Efficient Interior-Point Method for Hierarchical Least-Squares Programs von Pfeiffer, Kai, Escande, Adrien, Righetti, Ludovic

“… Each priority level contains an objective in least-squares form which is subject to the linear constraints of the higher priority levels …”
Volltext

The complexity of general-valued CSPs seen from the other side von Clement Carbonnel, Romero, Miguel, Zivny, Stanislav

“… (subject to complexity-theoretic assumptions) and of solvability by bounded-consistency algorithms (unconditionally …”
Volltext

The Computational Complexity of ReLU Network Training Parameterized by Data Dimensionality von Froese, Vincent, Hertrich, Christoph, Niedermeier, Rolf

“… ) has recently been a subject of intensive research. Closing gaps and complementing results from the literature, we present several results on the parameterized complexity of training two-layer ReLU networks with respect to various loss functions …”
Volltext

The Computational Complexity of Angry Birds von Stephenson, Matthew, Renz, Jochen, Ge, Xiaoyu

“… The physics-based simulation game Angry Birds has been heavily researched by the AI community over the past five years, and has been the subject of a popular AI competition that is currently held …”
Volltext

Sublinear-Time Language Recognition and Decision by One-Dimensional Cellular Automata von Modanese, Augusto

“… After an apparent hiatus of roughly 30 years, we revisit a seemingly neglected subject in the theory of (one-dimensional) cellular automata …”
Volltext

Complexity of 2D bootstrap percolation difficulty: Algorithm and NP-hardness von Hartarsky, Ivailo, Tamás Róbert Mezei

“… `difficulty', so the subject seemed closed up to finding sharper results. However, the computation of the difficulty, was never considered …”
Volltext

On the Complexity and Approximability of Optimal Sensor Selection and Attack for Kalman Filtering von Ye, Lintao, Woodford, Nathaniel, Roy, Sandip, Sundaram, Shreyas

“… ) to minimize the trace of the steady state a priori or a posteriori error covariance of the Kalman filter, subject to certain selection budget constraints …”
Volltext

Non-causal computation von Baumeler, Ämin, Wolf, Stefan

“… In other words, algorithm design is traditionally subject to the restriction imposed by a fixed causal order …”
Volltext

Quantum Hamiltonian Complexity von Gharibian, Sevag, Huang, Yichen, Landau, Zeph, Seung Woo Shin

“… -temperature quantum systems via so-called area laws. Our aim here is to provide a computer science-oriented introduction to the subject in order to help bridge the language barrier between computer scientists and physicists in the field …”
Volltext

The Hardness of Finding Linear Ranking Functions for Lasso Programs von Ben-Amram, Amir M

“… Finding whether a linear-constraint loop has a linear ranking function is an important key to understanding the loop behavior, proving its termination and …”
Volltext

A polynomial-time algorithm for estimating the partition function of the ferromagnetic Ising model on a regular matroid von Goldberg, Leslie Ann, Jerrum, Mark

“… ) for the class of graphic matroids. On the other hand, the authors have previously shown, subject to a complexity-theoretic assumption, that there is no FPRAS for the class of binary matroids, which is a proper superset of the class of graphic matroids …”
Volltext

Approximating the Tutte polynomial of a binary matroid and other related combinatorial polynomials von Goldberg, Leslie Ann, Jerrum, Mark

“… (subject to certain complexity assumptions) for q>2, apart from the trivial case gamma=0. The situation for q …”
Volltext

Connectivity Games over Dynamic Networks von Grüner, Sten, Radmacher, Frank G, Thomas, Wolfgang

“… A game-theoretic model for the study of dynamic networks is analyzed. The model is motivated by communication networks that are subject to failure of nodes and where the restoration needs resources …”
Volltext

Logics for the Relational Syllogistic von Pratt-Hartmann, Ian, Moss, Lawrence S

“… on (a) whether negation is permitted on all nouns, including those in the subject of a sentence …”
Volltext