Embedding Divisor and Semi-Prime Testability in f-vectors of polytopes

09/16/2021
by   Eran Nevo, et al.
0

We obtain computational hardness results for f-vectors of polytopes by exhibiting reductions of the problems DIVISOR and SEMI-PRIME TESTABILITY to problems on f-vectors of polytopes. Further, we show that the corresponding problems for f-vectors of simplicial polytopes are polytime solvable. The regime where we prove this computational difference (conditioned on standard conjectures on the density of primes and on P≠ NP) is when the dimension d tends to infinity and the number of facets is linear in d.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/18/2021

Congruence permutability is prime

We give a combinatorial proof that congruence permutability is prime in ...
research
01/31/2022

A new idea for RSA backdoors

This article proposes a new method to inject backdoors in RSA and other ...
research
05/25/2022

Prime Holdout Problems

This paper introduces prime holdout problems, a problem class related to...
research
07/17/2020

Integer factorization and Riemann's hypothesis: Why two-item joint replenishment is hard

Distribution networks with periodically repeating events often hold grea...
research
07/22/2022

Matching Triangles and Triangle Collection: Hardness based on a Weak Quantum Conjecture

Classically, for many computational problems one can conclude time lower...
research
08/12/2023

Effective Bounds for Restricted 3-Arithmetic Progressions in 𝔽_p^n

For a prime p, a restricted arithmetic progression in 𝔽_p^n is a triplet...
research
03/14/2023

Consistency of Fractional Graph-Laplacian Regularization in Semi-Supervised Learning with Finite Labels

Laplace learning is a popular machine learning algorithm for finding mis...

Please sign up or login with your details

Forgot password? Click here to reset