On the Expressive Power of Planar Perfect Matching and Permanents of Bounded Treewidth Matrices

doi 10.1007/978-3-540-77120-3_13
Full Text
Abstract

Available in full text

Date

Unknown

Authors
Publisher

Springer Berlin Heidelberg

Related search

The Stackelberg Minimum Spanning Tree Game on Planar and Bounded-Treewidth Graphs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2009English

Maximum Induced Forests in Graphs of Bounded Treewidth

Electronic Journal of Combinatorics
CombinatoricsApplied MathematicsMathematicsGeometryDiscrete MathematicsComputational TheoryTopologyTheoretical Computer Science
2013English

On the Expressive Power of Counting

Theoretical Computer Science
Computer ScienceTheoretical Computer Science
1995English

On the Expressive Power of OCL

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1999English

Inequalities for Permanents and Permanental Minors of Row Substochastic Matrices

Electronic Journal of Linear Algebra
Number TheoryAlgebra
2019English

Inequalities for Permanents and Permanental Minors of Row Substochastic Matrices

Electronic Journal of Linear Algebra
Number TheoryAlgebra
2019English

A Lower Bound for Permanents of $(0,\,1)$-Matrices

Proceedings of the American Mathematical Society
MathematicsApplied Mathematics
1967English

On the Expressive Power of Temporal Logic

Journal of Computer and System Sciences
Computer NetworksApplied MathematicsCommunicationsComputational TheoryMathematicsTheoretical Computer Science
1993English

Estimation of Sound Power of Baffled Planar Sources Using Radiation Matrices

Journal of the Acoustical Society of America
AcousticsUltrasonicsArtsHumanities
2002English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy