Query Order and NP-completeness

doi 10.1109/ccc.1999.766272
Full Text
Abstract

Available in full text

Date

Unknown

Authors
Publisher

IEEE Comput. Soc

Related search

Trusses, NP-Completeness, and Genetic Algorithms

2006English

Vandermonde Matrices, NP-Completeness, and Transversal Subspaces

Foundations of Computational Mathematics
MathematicsComputational MathematicsApplied MathematicsAnalysisComputational Theory
2003English

Bi-Immunity Separates Strong NP-Completeness Notions

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2002English

On Generic Np-Completeness of the Boolean Satisfiability Problem

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

NP-Completeness of Minimal Width Unordered Tree Layout

Journal of Graph Algorithms and Applications
GeometryComputer Science ApplicationsComputer ScienceMathematicsComputational TheoryTheoretical Computer ScienceTopology
2004English

Fuzzy Database Query Languages and Their Relational Completeness Theorem

IEEE Transactions on Knowledge and Data Engineering
Computational TheoryComputer Science ApplicationsInformation SystemsMathematics
1993English

Np-Completeness and Approximation Algorithm for the Maximum Integral Vertex-Balanced Flow Problem

Journal of the Operations Research Society of Japan
Management ScienceDecision SciencesOperations Research
1991English

Cook Versus Karp-Levin: Separating Completeness Notions if NP Is Not Small

Theoretical Computer Science
Computer ScienceTheoretical Computer Science
1996English

Order in NP Conjuncts in Spoken English and Japanese

Lingua
LinguisticsLanguage
2014English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy