Amanote Research

Amanote Research

    RegisterSign In

Inductive Complexity of the P Versus Np Problem

Parallel Processing Letters - Singapore
doi 10.1142/s0129626413500072
Full Text
Open PDF
Abstract

Available in full text

Categories
HardwareTheoretical Computer ScienceArchitectureSoftware
Date

March 1, 2013

Authors
CRISTIAN S. CALUDEELENA CALUDEMELISSA S. QUEEN
Publisher

World Scientific Pub Co Pte Lt


Related search

P, NP and Mathematics – A Computational Complexity Perspective

English

P/Np

Mitteilungen der Deutschen Mathematiker-Vereinigung
2018English

P vs NP Solution – Advances in Computational Complexity, Status and Future Scope

International Journal of Computer Applications
2019English

The Relative Complexity of NP Search Problems

1995English

Inequality in the Universe, Imaginary Numbers and a Brief Solution to P=NP? Problem

2019English

Is the Distance Geometry Problem in NP?

2012English

An NP-complete Matching Problem

Discrete Applied Mathematics
CombinatoricsApplied MathematicsDiscrete Mathematics
1980English

Inducible Expression of the P, V, and NP Genes of the Paramyxovirus Simian Virus 5 in Cell Lines and an Examination of NP-P and NP-V Interactions.

Journal of Virology
Insect ScienceImmunologyMicrobiologyVirology
1995English

On Generic Np-Completeness of the Boolean Satisfiability Problem

Prikladnaya Diskretnaya Matematika
Signal ProcessingCombinatoricsApplied MathematicsMathematicsDiscrete MathematicsComputational TheoryTheoretical Computer Science
2017English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy