Amanote Research

Amanote Research

    RegisterSign In

The Multivariate Quadratic Power Problem Over Zn Is Np-Complete

Information Technology and Control - Lithuania
doi 10.5755/j01.itc.41.1.821
Full Text
Open PDF
Abstract

Available in full text

Categories
ControlSystems EngineeringComputer Science ApplicationsElectricalElectronic Engineering
Date

April 24, 2012

Authors
Eligijus Sakalauskas
Publisher

Publishing House Technologija


Related search

An NP-complete Matching Problem

Discrete Applied Mathematics
CombinatoricsApplied MathematicsDiscrete Mathematics
1980English

Theory-Contraction Is NP-Complete

Logic Journal of the IGPL
Philosophy
2003English

Elastic Image Matching Is NP-complete

Pattern Recognition Letters
Signal ProcessingComputer VisionPattern RecognitionArtificial IntelligenceSoftware
2003English

Call Tree Reversal Is NP-Complete

Lecture Notes in Computational Science and Engineering
ControlCombinatoricsDiscrete MathematicsSimulationEngineeringOptimizationModelingComputational Mathematics
2008English

Is the Distance Geometry Problem in NP?

2012English

Revising Distributed UNITY Programs Is NP-Complete

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2008English

Testing Orientability for Matroids Is NP-Complete

Advances in Applied Mathematics
Applied Mathematics
1999English

Graph Decomposition Is NP-Complete: A Complete Proof of Holyer's Conjecture

SIAM Journal on Computing
MathematicsComputer Science
1997English

Checking Consistency of Pedigree Information Is NP-complete (Preliminary Report)

BRICS Report Series
2002English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2025 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy