A Nondeterministic Polynomial-Time Unification Algorithm for Bags, Sets and Trees

Lecture Notes in Computer Science - Germany
doi 10.1007/3-540-49019-1_13
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg

Related search

A Polynomial Time Algorithm for Fault Diagnosability

1984English

A Nondeterministic Minimization Algorithm

1990English

A Randomized Algorithm for Comparing Sets of Phylogenetic Trees

2007English

A Polynomial-Time Algorithm for Global Value Numbering

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2004English

A Polynomial-Time Parsing Algorithm for TT-MCTAG

2009English

A Polynomial Time Algorithm for Spatio-Temporal Security Games

2017English

A Polynomial-Time-Delay and Polynomial-Space Algorithm for Enumeration Problems in Multi-Criteria Optimization

English

A Fast Algorithm for Computing Optimal Rectilinear Steiner Trees for Extremal Point Sets

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1995English

A Polynomial Time Interior Point Algorithm for Minimum Cost Flow Problems

Journal of the Operations Research Society of Japan
Management ScienceDecision SciencesOperations Research
1990English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy