Regular switching components (Q2422036)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Regular switching components	scientific article

Statements

scholarly article

0 references

Regular switching components (English)

0 references

Theoretical Computer Science

0 references

publication date

18 June 2019

0 references

zbMATH Keywords

discrete tomography

0 references

X-rays

0 references

HV-convex lattice sets

0 references

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1016/j.tcs.2019.01.010

0 references

In memoriam: Alberto Del Lungo (1965--2003)

0 references

0 references

Discrete tomography. Foundations, algorithms, and applications

0 references

Advances in discrete tomography and its applications. Some papers based on the presentations at the workshop on discrete tomography and its applications, New York, NY, USA, June 13--15, 2005.

0 references

A theorem on flows in networks

0 references

Combinatorial Properties of Matrices of Zeros and Ones

0 references

Three-dimensional Statistical Data Security Problems

0 references

About the Complexity of Timetables and 3-Dimensional Discrete Tomography: A Short Proof of NP-Hardness

0 references

On the computational complexity of reconstructing lattice sets from their \(X\)-rays

0 references

On the computational complexity of determining polyatomic structures by X-rays

0 references

Reconstructing 3-Colored Grids from Horizontal and Vertical Projections Is NP-hard

0 references

Discrete tomography: Determination of finite sets by X-rays

0 references

Reconstruction of convex lattice sets from tomographic projections in quartic time

0 references

Reconstructing convex polyominoes from horizontal and vertical projections

0 references

The reconstruction of polyominoes from their orthogonal projections

0 references

Reconstructing Binary Matrices with Neighborhood Constraints: An NP-hard Problem

0 references

First steps in the algorithmic reconstruction of digital convex sets

0 references

Fast Filling Operations Used in the Reconstruction of Convex Lattice Sets

0 references

A linear-time algorithm for testing the truth of certain quantified Boolean formulas

0 references

Identifiers

zbMATH Open document ID

0 references

10.1016/j.tcs.2019.01.010

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

zbMATH DE Number

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2422036

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2422036&oldid=37845734"