Amanote Research

Amanote Research

    RegisterSign In

A Polynomial Algorithm for the Membership Problem With Categorial Grammars

Theoretical Computer Science - Netherlands
doi 10.1016/0304-3975(95)00211-1
Full Text
Open PDF
Abstract

Available in full text

Categories
Computer ScienceTheoretical Computer Science
Date

September 1, 1996

Authors
Alain FinkelIsabelle Tellier
Publisher

Elsevier BV


Related search

Polynomial Time Parsing of Combinatory Categorial Grammars

1990English

Learning Discrete Categorial Grammars From Structures

RAIRO - Theoretical Informatics and Applications
MathematicsComputer Science ApplicationsSoftware
2008English

Syntactico-Semantic Learning of Categorial Grammars

1998English

A Polynomial Algorithm for the Hamiltonian Cycle Problem in Semicomplete Multipartite Digraphs

Journal of Graph Theory
GeometryTopology
1998English

A Polynomial-Time Algorithm for the Paired-Domination Problem on Permutation Graphs

Discrete Applied Mathematics
CombinatoricsApplied MathematicsDiscrete Mathematics
2009English

A Polynomial-Time Algorithm for a Stable Matching Problem With Linear Valuations and Bounded Side Payments

Japan Journal of Industrial and Applied Mathematics
EngineeringApplied Mathematics
2008English

A Polynomial Time Algorithm for Fault Diagnosability

1984English

A Polynomial Projection-Type Algorithm for Linear Programming

Operations Research Letters
IndustrialApplied MathematicsManufacturing EngineeringManagement ScienceOperations ResearchSoftware
2014English

A Polynomial Based Hashing Algorithm

2008English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2025 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy