UB Paderborn / Katalog / Suche / in CDI

Sortiert nach

Einfacher Volltextzugriff von (fast) überall

Installieren Sie die LibKey Nomad-Browsererweiterung und erhalten Sie von vielen Webseiten einfachen Zugriff auf lizenzierte Volltexte oder Open Access Publikationen. Mehr erfahren...

On Weisfeiler-Leman Invariance: Subgraph Counts and Related Graph Properties

Fundamentals of Computation Theory, p.111-125

Volltextzugriff (PDF)

Helly Circular-Arc Graph Isomorphism Is in Logspace

Mathematical Foundations of Computer Science 2013, p.631-642

Volltextzugriff (PDF)

A Multiscale Fatigue Model for the Degradation of Fiber-Reinforced Materials

Large-Scale Scientific Computing, p.387-392

Volltextzugriff (PDF)

On Graph Isomorphism for Restricted Graph Classes

Lecture notes in computer science, 2006, p.241-256

2006

Volltextzugriff (PDF)

Approximate Graph Isomorphism

Mathematical Foundations of Computer Science 2012, p.100-111

Volltextzugriff (PDF)

Explicit Diffusion of Gaussian Mixture Model Based Image Priors

Lecture Notes in Computer Science, 2023, Vol.14009, p.3-15

2023

Volltextzugriff (PDF)

Time Discrete Geodesics in Deep Feature Spaces for Image Morphing

Scale Space and Variational Methods in Computer Vision, p.171-182

Volltextzugriff (PDF)

Solving Linear Equations Parameterized by Hamming Weight

Parameterized and Exact Computation, 2014, Vol.8894, p.39-50

2014

Volltextzugriff (PDF)

Average-case intractability vs. worst-case intractability

Lecture notes in computer science, 1998, p.493-502

1998

Volltextzugriff (PDF)

The Complexity of Graph Isomorphism for Colored Graphs with Color Classes of Size 2 and 3

Lecture notes in computer science, 2002, p.121-132

2002

Volltextzugriff (PDF)

Lowness and the complexity of sparse and tally descriptions

Algorithms and Computation, 2005, p.249-258

2005

Volltextzugriff (PDF)

On the Existence and Determination of Satisfactory Partitions in a Graph

Algorithms and Computation, 2003, p.444-453

2003

Volltextzugriff (PDF)

OpenMP Shared Memory Parallel Programming: International Workshop on OpenMP Applications and Tools, WOMPAT 2001, West Lafayette, in, USA, July 30-31, 2001 Proceedings

1, 2001

Volltextzugriff (PDF)

High-Performance Computing and Networking: 8th International Conference, HPCN Europe 2000 Amsterdam, the Netherlands, May 8-10, 2000 Proceedings

1, 2000

Volltextzugriff (PDF)

A polynomial time equivalence between DNA sequencing and the exact perfect matching problem

Discrete optimization, 2007-06, Vol.4 (2), p.154-162

2007

Volltextzugriff (PDF)

Recognizing DNA graphs is difficult

Discrete Applied Mathematics, 2003-04, Vol.127 (1), p.85-94

2003

Volltextzugriff (PDF)

Towards the Actual Relationship Between NP and Exponential Time

Mathematical logic quarterly, 1999, Vol.45 (1), p.31-49

Lischke, Gerhard

1999

Volltextzugriff (PDF)

Parameterized Complexity in the Polynomial Hierarchy: Extending Parameterized Complexity Theory to Higher Levels of the Hierarchy

de Haan, Ronald

1st Edition 2019, 2019

Volltextzugriff (PDF)

On Digital Signatures Based on Group Actions: QROM Security and Ring Signatures

Post-Quantum Cryptography, p.227-261

Volltextzugriff (PDF)

The Balanced Satisfactory Partition Problem

SOFSEM 2021: Theory and Practice of Computer Science, p.322-336

Volltextzugriff (PDF)

Practical Post-Quantum Signature Schemes from Isomorphism Problems of Trilinear Forms

Advances in Cryptology – EUROCRYPT 2022, p.582-612

Volltextzugriff (PDF)

Disconnected Matchings

Computing and Combinatorics, p.579-590

Volltextzugriff (PDF)

A Self-interpolation Method for Digital Terrain Model Generation

Computational Science and Its Applications – ICCSA 2021, p.352-363

Volltextzugriff (PDF)

On the Parallel Complexity of Group Isomorphism via Weisfeiler–Leman

Fundamentals of Computation Theory, 2023, Vol.14292, p.234-247

2023

Volltextzugriff (PDF)

Graphs Identified by Logics with Counting

Mathematical Foundations of Computer Science 2015, p.319-330

Volltextzugriff (PDF)

1 – 25 von 66

Suche als RSS-Feed

Aktive Filter

SpracheCroatian

ThemaMathematics

KollektionElsevier Journal Backfiles on ScienceDirect (DFG Nationallizenzen)

Suchergebnisse filtern

Filter anzeigen

Nur zeigen

Geprüft (Peer-Review)
(65)
Mit Volltextzugriff
(66)

Publikationsform

Sprache

Englisch
(66)
Japanisch
(3)

Erscheinungsjahr

n.n

Zeitschrift / Serie

3 weitere anzeigen...

Weniger anzeigen...

Menü

Weitere Dienste

Einstellungen

On Weisfeiler-Leman Invariance: Subgraph Counts and Related Graph Properties

Helly Circular-Arc Graph Isomorphism Is in Logspace

A Multiscale Fatigue Model for the Degradation of Fiber-Reinforced Materials

On Graph Isomorphism for Restricted Graph Classes

Approximate Graph Isomorphism

Explicit Diffusion of Gaussian Mixture Model Based Image Priors

Time Discrete Geodesics in Deep Feature Spaces for Image Morphing

Solving Linear Equations Parameterized by Hamming Weight

Average-case intractability vs. worst-case intractability

The Complexity of Graph Isomorphism for Colored Graphs with Color Classes of Size 2 and 3

Lowness and the complexity of sparse and tally descriptions

On the Existence and Determination of Satisfactory Partitions in a Graph

OpenMP Shared Memory Parallel Programming: International Workshop on OpenMP Applications and Tools, WOMPAT 2001, West Lafayette, in, USA, July 30-31, 2001 Proceedings

High-Performance Computing and Networking: 8th International Conference, HPCN Europe 2000 Amsterdam, the Netherlands, May 8-10, 2000 Proceedings

A polynomial time equivalence between DNA sequencing and the exact perfect matching problem

Recognizing DNA graphs is difficult

Towards the Actual Relationship Between NP and Exponential Time

Parameterized Complexity in the Polynomial Hierarchy: Extending Parameterized Complexity Theory to Higher Levels of the Hierarchy

On Digital Signatures Based on Group Actions: QROM Security and Ring Signatures

The Balanced Satisfactory Partition Problem

Practical Post-Quantum Signature Schemes from Isomorphism Problems of Trilinear Forms

Disconnected Matchings

A Self-interpolation Method for Digital Terrain Model Generation

On the Parallel Complexity of Group Isomorphism via Weisfeiler–Leman

Graphs Identified by Logics with Counting

Aktive Filter

Suchergebnisse filtern