scientific article; zbMATH DE number 1418967
From MaRDI portal
Publication:4942157
zbMath1001.68050MaRDI QIDQ4942157
Publication date: 20 March 2000
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (63)
Influence maximization problem: properties and algorithms ⋮ A note on quadratic residuosity and UP ⋮ Polynomially-bounded Dehn functions of groups ⋮ On the complexity of the pancake problem ⋮ \(\mathbf P =\mathbf{NP}\) for some structures over the binary words ⋮ Relativized collapsing between BPP and PH under stringent oracle access ⋮ Polynomial time quantum computation with advice ⋮ A semantically secure public key cryptoscheme using bit-pair shadows ⋮ A provably secure non-iterative hash function resisting birthday attack ⋮ On the complexity of finding circumscribed rectangles and squares for a two-dimensional domain ⋮ A Public Key Cryptoscheme Using Bit-Pairs with Provable Semantical Security ⋮ On the complexity of computing the logarithm and square root functions on a complex domain ⋮ A new algorithm design technique for hard problems ⋮ New dominating sets in social networks ⋮ On parallel complexity of analytic functions ⋮ On testing monomials in multivariate polynomials ⋮ Space functions and space complexity of the word problem in semigroups. ⋮ Complexity and Algorithms for Well-Structured k-SAT Instances ⋮ On positive influence dominating sets in social networks ⋮ Observations on complete sets between linear time and polynomial time ⋮ Levels of undecidability in rewriting ⋮ A public key cryptosystem based on three new provable problems ⋮ Simple explanation of the no-free-lunch theorem and its implications ⋮ On the complexity of computing the Hausdorff distance ⋮ Managing complexity in industrial collaborations ⋮ In Memoriam: Ker-I Ko (1950–2018) ⋮ On the complexity of non-unique probe selection ⋮ Finding quasi core with simulated stacked neural networks ⋮ On the Complexity of Convex Hulls of Subsets of the Two-Dimensional Plane ⋮ Polynomial upper bounds on the size of changes of a RAM+BOOL program as a tool for proving belonging to FP ⋮ Computational ludics ⋮ On the Complexity of the Pancake Problem ⋮ Jordan Curves with Polynomial Inverse Moduli of Continuity ⋮ Conformant plans and beyond: principles and complexity ⋮ Computation of algebraic numbers and arithmetic operations over them with linear memory ⋮ Lower bounds and the hardness of counting properties ⋮ The computational complexity of distance functions of two-dimensional domains ⋮ Accepting networks of genetic processors are computationally complete ⋮ Computational power of infinite quantum parallelism ⋮ Arthur and Merlin as Oracles ⋮ Asymptotic granularity reduction and its application ⋮ A note on width-parameterized SAT: an exact machine-model characterization ⋮ Polynomial-time right-ideal morphisms and congruences ⋮ Function operators spanning the arithmetical and the polynomial hierarchy ⋮ Exact and approximate algorithms for discounted \(\{0\text{-}1\}\) knapsack problem ⋮ Non-unique probe selection and group testing ⋮ Jordan curves with polynomial inverse moduli of continuity ⋮ Algorithms for randomized time-varying knapsack problems ⋮ Smale’s 17th problem: Average polynomial time to compute affine and projective solutions ⋮ $LINSPACE$ конструктивный аналог функции $(1+x)^h$ ⋮ Minimal achievable approximation ratio for MAX-MQ in finite fields ⋮ The word problem of the Brin-Thompson group is \textsf{coNP}-complete ⋮ On the computational complexity of the languages of general symbolic dynamical systems and beta-shifts ⋮ Space functions of groups ⋮ Theory of one-tape linear-time Turing machines ⋮ Positive influence domination in graphs ⋮ Unnamed Item ⋮ The polynomial hierarchy for some structures over the binary words ⋮ Resource bounded immunity and simplicity ⋮ Improved lower bounds on the randomized complexity of graph properties ⋮ Liouville numbers and the computational complexity of changing bases ⋮ On the complexity of conversion between classic real number representations ⋮ Group coloring is \(\Pi_2^{\text{P}}\)-complete
This page was built for publication:
