Call Tree Reversal Is NP-Complete

Lecture Notes in Computational Science and Engineering - Germany
doi 10.1007/978-3-540-68942-3_2
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg

Related search

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

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

The Multivariate Quadratic Power Problem Over Zn Is Np-Complete

Information Technology and Control
ControlSystems EngineeringComputer Science ApplicationsElectricalElectronic Engineering
2012English

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

BRICS Report Series
2002English

An NP-complete Matching Problem

Discrete Applied Mathematics
CombinatoricsApplied MathematicsDiscrete Mathematics
1980English

Maximizing Output and Recognizing Autocatalysis in Chemical Reaction Networks Is NP-complete

Journal of Systems Chemistry
2012English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy