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...

Inverse Hamiltonian Cycle and inverse 3Dimensional Matching are coNP-complete

Theoretical computer science, 2012-04, Vol.426-427, p.49-65

2012

Volltextzugriff (PDF)

Algebraic Properties for P-Selectivity

Computing and Combinatorics, 2001, p.49-58

2001

Volltextzugriff (PDF)

ASPECTS OF PERSISTENT COMPUTATIONS

International journal of foundations of computer science, 2009-08, Vol.20 (4), p.701-715

2009

Volltextzugriff (PDF)

Reoptimization of Traveling Salesperson Problems: Changing Single Edge-Weights

Language and Automata Theory and Applications, p.141-151

Volltextzugriff (PDF)

Persistent Computations of Turing Machines

Implementation and Applications of Automata, p.171-180

Volltextzugriff (PDF)

On claw-free asteroidal triple-free graphs

Discrete Applied Mathematics, 2002-09, Vol.121 (1), p.155-180

2002

Volltextzugriff (PDF)

On Functions and Relations

Discrete Mathematics and Theoretical Computer Science, 2003, p.181-192

2003

Volltextzugriff (PDF)

All superlinear inverse schemes are coNP-hard

Theoretical computer science, 2005-11, Vol.345 (2), p.345-358

2005

Volltextzugriff (PDF)

Approximating Alternative Solutions

Computing and Combinatorics, p.204-214

Volltextzugriff (PDF)

THE OPERATORS MIN AND MAX ON THE POLYNOMIAL HIERARCHY

International journal of foundations of computer science, 2000-06, Vol.11 (2), p.315-342

2000

Volltextzugriff (PDF)

Inverse HAMILTONIAN CYCLE and Inverse 3-D MATCHING Are coNP-Complete

Algorithms and Computation, 2006, p.243-252

2006

Volltextzugriff (PDF)

Extending downward collapse from 1-versus-2 queries to m-versus-m+1 queries

SIAM journal on computing, 2005, Vol.34 (6), p.1352-1369

2005

Volltextzugriff (PDF)

P-immune sets with holes lack self-reducibility properties

Theoretical computer science, 2003-06, Vol.302 (1), p.457-466

2003

Volltextzugriff (PDF)

Algebraic properties for selector functions

SIAM journal on computing, 2004, Vol.33 (6), p.1309-1337

2004

Volltextzugriff (PDF)

Smart City Logistik Erfurt (SCL): ICT-support for managing fully electric vehicles in the domain of inner city freight traffic

2015 International Conference on Industrial Engineering and Operations Management (IEOM), 2015, p.1-8

2015

Volltextzugriff (PDF)

All Superlinear Inverse Schemes Are coNP-Hard

Lecture notes in computer science, 2004, p.368-379

2004

Volltextzugriff (PDF)

Stochastic dynamics of catalytic CO oxidation on Pt(100)

Physica A, 1994-05, Vol.206 (3), p.421-440

1994

Volltextzugriff (PDF)

SELF-SPECIFYING MACHINES

International journal of foundations of computer science, 1999-09, Vol.10 (3), p.263-276

1999

Volltextzugriff (PDF)

Extending Downward Collapse from 1-versus-2 Queries to j-versus-j + 1 Queries

Lecture notes in computer science, 1999, p.270-280

1999

Volltextzugriff (PDF)

A Downward Collapse within the Polynomial Hierarchy

SIAM journal on computing, 1998-01, Vol.28 (2), p.383-393

1998

Volltextzugriff (PDF)

Randomized Algorithms and Complexity Theory

Harald Hempel

2006

Volltextzugriff (PDF)

Optimal Series-Parallel Trade-offs for Reducing a Function to Its Own Graph

Information and computation, 2002-03, Vol.173 (2), p.123-131

2002

Volltextzugriff (PDF)

Query Order

SIAM journal on computing, 1998-01, Vol.28 (2), p.637-651

1998

Volltextzugriff (PDF)

The operators min and max on the polynomial hierarchy

STACS 97, 1997, p.93-104

1997

Volltextzugriff (PDF)

On Claw-Free Asteroidal Triple-Free Graphs

Graph-Theoretic Concepts in Computer Science, 1999, p.377-390

1999

Volltextzugriff (PDF)

1 – 25 von 83

Menü

Weitere Dienste

Einstellungen

Inverse Hamiltonian Cycle and inverse 3Dimensional Matching are coNP-complete

Algebraic Properties for P-Selectivity

ASPECTS OF PERSISTENT COMPUTATIONS

Reoptimization of Traveling Salesperson Problems: Changing Single Edge-Weights

Persistent Computations of Turing Machines

On claw-free asteroidal triple-free graphs

On Functions and Relations

All superlinear inverse schemes are coNP-hard

Approximating Alternative Solutions

THE OPERATORS MIN AND MAX ON THE POLYNOMIAL HIERARCHY

Inverse HAMILTONIAN CYCLE and Inverse 3-D MATCHING Are coNP-Complete

Extending downward collapse from 1-versus-2 queries to m-versus-m+1 queries

P-immune sets with holes lack self-reducibility properties

Algebraic properties for selector functions

Smart City Logistik Erfurt (SCL): ICT-support for managing fully electric vehicles in the domain of inner city freight traffic

All Superlinear Inverse Schemes Are coNP-Hard

Stochastic dynamics of catalytic CO oxidation on Pt(100)

SELF-SPECIFYING MACHINES

Extending Downward Collapse from 1-versus-2 Queries to j-versus-j + 1 Queries

A Downward Collapse within the Polynomial Hierarchy

Randomized Algorithms and Complexity Theory

Optimal Series-Parallel Trade-offs for Reducing a Function to Its Own Graph

Query Order

The operators min and max on the polynomial hierarchy

On Claw-Free Asteroidal Triple-Free Graphs

Suchergebnisse filtern