Search
Search Results
-
Direct Product Hardness Amplification
We revisit one of the most fundamental hardness amplification constructions, originally proposed by Yao (FOCS 1982). We present a hardness...
-
Constructions of column-orthogonal strong orthogonal arrays via matchings of bipartite graphs
Strong orthogonal arrays (SOAs) have better space-filling properties than ordinary orthogonal arrays for computer experiments. SOAs of strengths two...
-
Strong metric dimension in annihilating-ideal graph of commutative rings
In this paper, using Gallai’s Theorem and the notion of strong resolving graph, we determine the strong metric dimension in annihilating-ideal graph...
-
Efficiently-Verifiable Strong Uniquely Solvable Puzzles and Matrix Multiplication
We advance the Cohn-Umans framework for develo** fast matrix multiplication algorithms. We introduce, analyze, and search for a new subclass of...
-
Ramsey’s theorem
Ramsey proved his eponymous theorem in his 1929 paper “On a problem of formal logic” [253]. The focus was actually not on combinatorics at all, but...
-
Average case error estimates of the strong Lucas test
Reliable probabilistic primality tests are fundamental in public-key cryptography. In adversarial scenarios, a composite with a high probability of...
-
-
Modular language product lines: concept, tool and analysis
Modelling languages are intensively used in paradigms like model-driven engineering to automate all tasks of the development process. These languages...
-
-
On Strong Basins of Attractions for Non-convex Sparse Spike Estimation: Upper and Lower Bounds
In this article, we study the size of strong basins of attractions for the non-convex sparse spike estimation problem. We first extend previous...
-
Research on chaos of product color image system driven by brand image
Chaos means innovation in the field of design. Meanwhile, the product image system is not only a quantified ‘formula’ between product and...
-
Metric dimension and strong metric dimension in annihilator-ideal graphs
Let R be a commutative ring with identity and A ( R ) be the set of ideals with non-zero annihilator. The annihilator-ideal graph of R is defined as the...
-
On Derandomizing Yao’s Weak-to-Strong OWF Construction
The celebrated result of Yao (Yao, FOCS’82) shows that concatenating $$n\cdot...
-
Parallel Single-Pixel Imaging: A General Method for Direct–Global Separation and 3D Shape Reconstruction Under Strong Global Illumination
We present parallel single-pixel imaging (PSI), a photography technique that captures light transport coefficients and enables the separation of...
-
Yet Another Impossibility Theorem in Algorithmic Fairness
In recent years, there has been a surge in research addressing the question which properties predictive algorithms ought to satisfy in order to be...
-
Enhancing and Evaluating the Product Fuzzy DPLL Solver
In recent years we have seen a number of satisfiability solvers emerge in the world of fuzzy propositional logics. However, only a few of them can...
-
The Myhill-Nerode Theorem: Implications and Applications
With this chapter, we arrive finally at the first of the blockbuster results that underlie computation theory. The Myhill–Nerode theorem of Finite...
-
When Is Context-Freeness Distinguishable from Regularity? an Extension of Parikh’s Theorem
Parikh’s theorem states that for every CFL X, there exists a regular language...
-
Pattern Matching in Encrypted Stream from Inner Product Encryption
Functional encryption features secret keys, each associated with a key function f, which allow to directly recover f(x) from an encryption of x,...
-
Key-Recovery by Side-Channel Information on the Matrix-Vector Product in Code-Based Cryptosystems
The modern security protocols in most of our systems rely primarily on three basic functions of asymmetric cryptography: public key encryption,...