Skip to contents

Aldema Tshuva, Eden [Author]; Oshman, Rotem [Author] ; Eden Aldema Tshuva and Rotem Oshman [Contributor]

On Polynomial Time Local Decision

View online
Schließen

Access

Close

Bookmarks

You can manage bookmarks using lists, please log in to your user account for this.

Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2024
Yannakakis, Mihalis [Author] ; Mihalis Yannakakis [Contributor]

Fixed Point Computation Problems and Facets of Complexity (Invited Talk)

View online
Schließen

Access

Close

Bookmarks

You can manage bookmarks using lists, please log in to your user account for this.

Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2019
Bagnol, Marc [Author]; Kuperberg, Denis [Author] ; Marc Bagnol and Denis Kuperberg [Contributor]

Büchi Good-for-Games Automata Are Efficiently Recognizable

View online
Schließen

Access

Close

Bookmarks

You can manage bookmarks using lists, please log in to your user account for this.

Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2018
Berczi, Kristof [Author]; Kobayashi, Yusuke [Author] ; Kristof Berczi and Yusuke Kobayashi [Contributor]

The Directed Disjoint Shortest Paths Problem

View online
Schließen

Access

Close

Bookmarks

You can manage bookmarks using lists, please log in to your user account for this.

Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2017
Iwata, Satoru [Author] ; Satoru Iwata [Contributor]

Weighted Linear Matroid Parity

View online
Schließen

Access

Close

Bookmarks

You can manage bookmarks using lists, please log in to your user account for this.

Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2017
Avanzini, Martin [Author]; Dal Lago, Ugo [Author] ; Martin Avanzini and Ugo Dal Lago [Contributor]

On Sharing, Memoization, and Polynomial Time

View online
Schließen

Access

Close

Bookmarks

You can manage bookmarks using lists, please log in to your user account for this.

Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2015
Grädel, Erich [Author]; Pakusa, Wied [Author] ; Erich Grädel and Wied Pakusa [Contributor]

Rank Logic is Dead, Long Live Rank Logic!

View online
Schließen

Access

Close

Bookmarks

You can manage bookmarks using lists, please log in to your user account for this.

Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2015
Nies, André [Author] ; André Nies [Contributor]

Differentiability of polynomial time computable functions

View online
Schließen

Access

Close

Bookmarks

You can manage bookmarks using lists, please log in to your user account for this.

Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2014
Felgenhauer, Bertram [Author] ; Bertram Felgenhauer [Contributor]

Deciding Confluence of Ground Term Rewrite Systems in Cubic Time

View online
Schließen

Access

Close

Bookmarks

You can manage bookmarks using lists, please log in to your user account for this.

Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2012
Babai, László [Author]; Qiao, Youming [Author] ; László Babai and Youming Qiao [Contributor]

Polynomial-time Isomorphism Test for Groups with Abelian Sylow Towers

View online
Schließen

Access

Close

Bookmarks

You can manage bookmarks using lists, please log in to your user account for this.

Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2012
Herings, P. Jean-Jacques [Author]; Jurdzinski, Marcin [Author]; Bro Miltersen, Peter [Author]; Tardos, Eva [Author]; von Stengel, Bernhard [Author] ; P. Jean-Jacques Herings and Marcin Jurdzinski and Peter Bro Miltersen and Eva Tardos and Bernhard von Stengel [Contributor]

07471 Abstracts Collection – Equilibrium Computation

View online
Schließen

Access

Close

Bookmarks

You can manage bookmarks using lists, please log in to your user account for this.

Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2008
Dietzfelbinger, Martin [Author]

Primality Testing in Polynomial Time : From Randomized Algorithms to "PRIMES Is in P"

View online
Schließen

Access

Full access (via DOI)

Show more show less

Close

Bookmarks

You can manage bookmarks using lists, please log in to your user account for this.

Berlin, Heidelberg: Springer Berlin Heidelberg, 2004

Published in: Lecture notes in computer science ; 3000
Diehl, Scott [Author]; van Melkebeek, Dieter [Author] ; Scott Diehl and Dieter van Melkebeek [Contributor]

Time-Space Lower Bounds for the Polynomial-Time Hierarchy on Randomized Machines

View online
Schließen

Access

Close

Bookmarks

You can manage bookmarks using lists, please log in to your user account for this.

Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2006
Gallego, Guillermo [Author]; Iravani, Mina M [Author]; Talebian, Masoud [Author]

Constrained Assortment Optimization with Satisficers Consumers

View online
Schließen

Access

Full access (via DOI)

https://ssrn.com/abstract=4402473

Show more show less

Close

Bookmarks

You can manage bookmarks using lists, please log in to your user account for this.

[S.l.]: SSRN, [2023]
Mader, Sebastian [Author] ; Hill, Joachim [Degree supervisor]

A Framework for the Phenological Analysis of Hypertemporal Remote Sensing Data Based on Polynomial Spline Models

View online
Schließen

Access

https://d-nb.info/1197698884/34

kostenfrei

Show more show less

Close

Bookmarks

You can manage bookmarks using lists, please log in to your user account for this.

Trier: Universität Trier, 2012
Nadara, Wojciech [Author]; Pilipczuk, Michał [Author]; Smulewicz, Marcin [Author] ; Wojciech Nadara and Michał Pilipczuk and Marcin Smulewicz [Contributor]

Computing Treedepth in Polynomial Space and Linear FPT Time

View online
Schließen

Access

Close

Bookmarks

You can manage bookmarks using lists, please log in to your user account for this.

Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2022
Buhrman, Harry [Author]; Thierauf, Thomas [Author]

The complexity of generating and checking proofs of membership

View online
Schließen

Access

More information on the full text

Show more show less

Close

Bookmarks

You can manage bookmarks using lists, please log in to your user account for this.

Ulm: Universität Ulm, Fakultät für Ingenieurwissenschaften und Informatik, 2010

Published in: Ulmer Informatik-Berichte ; 95,03
Suchý, Ondrj [Author] ; Ondrj Suchý [Contributor]

Extending the Kernel for Planar Steiner Tree to the Number of Steiner Vertices

View online
Schließen

Access

Close

Bookmarks

You can manage bookmarks using lists, please log in to your user account for this.

Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2015
Viola, Emanuele [Author] ; Emanuele Viola [Contributor]

On Probabilistic Time versus Alternating Time

View online
Schließen

Access

Close

Bookmarks

You can manage bookmarks using lists, please log in to your user account for this.

Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2006
Dietzfelbinger, Martin [Author]

Primality testing in polynomial time : from randomized algorithms to "PRIMES is in P"

View online
Schließen

Access

Full access (via DOI)

Show more show less

Close

Bookmarks

You can manage bookmarks using lists, please log in to your user account for this.

Berlin; Heidelberg: Springer, 2004

Published in: Lecture notes in computer science ; 300000

You did not find what you were looking for?

Purchase suggestion
Are you missing something you need for your research? If you have any suggestions please share them here.

Interlibrary Loan
Please search and order your favorite title in the Interlibrary Loan Portal.

Search in field:

Recently searched for:

You did not find what you were looking for?

> Year of publication

Year of publication