- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Extent
-
Online-Ressource
- Language
-
Englisch
- Notes
-
In: Finite-state methods and natural language processing : 6th International Workshop, FSMNLP 2007 / II Regular Papers
- Event
-
Veröffentlichung
- (where)
-
Potsdam
- (who)
-
Universität Potsdam
- (when)
-
2008
- Creator
-
Bonfante, Guillaume
Le Roux, Joseph
- URN
-
urn:nbn:de:kobv:517-opus-27146
- Rights
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
25.03.2025, 1:53 PM CET
Data provider
This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Associated
- Bonfante, Guillaume
- Le Roux, Joseph
- Universität Potsdam
Time of origin
- 2008
Other Objects (12)
Planar Steiner Orientation is NP-complete
PDL with intersection and converse is 2EXP-complete
Lexicalized non-local MCTAG with dominance links is NP-complete
All complete intersection Calabi-Yau four-folds
Strange Duality Between the Quadrangle Complete Intersection Singularities
Nonlinear optimization for matroid intersection and extensions
Deciding Whether a Grid is a Topological Subgraph of a Planar Graph is NP-Complete
The bandwidth-minimization problem for caterpillars with hair length 3 is NP-complete
Hilbert’s Nullstellensatz and NP-Complete Problems
Automating Resolution is NP-Hard
PDL with Intersection and Converse is Decidable
Reinforcement learning based traffic optimization at an intersection with GLOSA
Planar Steiner Orientation is NP-complete
PDL with intersection and converse is 2EXP-complete
Lexicalized non-local MCTAG with dominance links is NP-complete
All complete intersection Calabi-Yau four-folds
Strange Duality Between the Quadrangle Complete Intersection Singularities
Nonlinear optimization for matroid intersection and extensions
Deciding Whether a Grid is a Topological Subgraph of a Planar Graph is NP-Complete
The bandwidth-minimization problem for caterpillars with hair length 3 is NP-complete
Hilbert’s Nullstellensatz and NP-Complete Problems
Automating Resolution is NP-Hard
PDL with Intersection and Converse is Decidable
Reinforcement learning based traffic optimization at an intersection with GLOSA
Planar Steiner Orientation is NP-complete
PDL with intersection and converse is 2EXP-complete
Lexicalized non-local MCTAG with dominance links is NP-complete
All complete intersection Calabi-Yau four-folds
Strange Duality Between the Quadrangle Complete Intersection Singularities
Nonlinear optimization for matroid intersection and extensions
Deciding Whether a Grid is a Topological Subgraph of a Planar Graph is NP-Complete
The bandwidth-minimization problem for caterpillars with hair length 3 is NP-complete
Hilbert’s Nullstellensatz and NP-Complete Problems
Automating Resolution is NP-Hard
PDL with Intersection and Converse is Decidable