Amanote Research

Amanote Research

    RegisterSign In

On the Complexity of Computing Treebreadth

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-319-44543-4_1
Full Text
Open PDF
Abstract

Available in full text

Categories
Computer ScienceTheoretical Computer Science
Date

January 1, 2016

Authors
Guillaume DucoffeSylvain LegayNicolas Nisse
Publisher

Springer International Publishing


Related search

On the Complexity of Computing an Equilibrium in Combinatorial Auctions

2014English

Complexity in Scalable Computing

Scientific Programming
Computer Science ApplicationsSoftware
2008English

On the Complexity of Computing the Order of Repetition of a String

2000English

Computing on a Free Tree via Complexity-Preserving Mappings

1984English

Tackling Complexity in High Performance Computing Applications

International Journal of Parallel Programming
Theoretical Computer ScienceInformation SystemsSoftware
2016English

A Computational Complexity Theory in Membrane Computing

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2010English

Exponential Rise of Dynamical Complexity in Quantum Computing Through Projections

Nature Communications
AstronomyGeneticsMolecular BiologyBiochemistryChemistryPhysics
2014English

Complexity and High-End Computing in Biology and Medicine

Advances in Experimental Medicine and Biology
BiochemistryMedicineGeneticsMolecular Biology
2011English

Multithreading Decoupled Architectures for Complexity-Effective General Purpose Computing

ACM SIGARCH Computer Architecture News
2001English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy