Amanote Research

Amanote Research

    RegisterSign In

Polynomial Time Uniform Word Problems

Mathematical Logic Quarterly - Germany
doi 10.1002/malq.19950410204
Full Text
Open PDF
Abstract

Available in full text

Categories
Logic
Date

January 1, 1995

Authors
Stanley Burris
Publisher

Wiley


Related search

Polynomial-Time Approximation Schemes for Scheduling Problems With Time Lags

Journal of Scheduling
Management ScienceEngineeringOperations ResearchArtificial IntelligenceSoftware
2009English

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

English

Polynomial Time Approximation Schemes for Dense Instances of NP-Hard Problems

Journal of Computer and System Sciences
Computer NetworksApplied MathematicsCommunicationsComputational TheoryMathematicsTheoretical Computer Science
1999English

A Polynomial Time Interior Point Algorithm for Minimum Cost Flow Problems

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

Word-Length Optimization of Folded Polynomial Evaluation

English

Convex Polynomial Approximation in the Uniform Norm: Conclusion

Canadian Journal of Mathematics
Mathematics
2005English

Polynomial Time Approximation Schemes for the Traveling Repairman and Other Minimum Latency Problems.

2013English

Layered Graphs: A Class That Admits Polynomial Time Solutions for Some Hard Problems

2018English

Uniform Bounds for Isoperimetric Problems

Proceedings of the American Mathematical Society
MathematicsApplied Mathematics
1989English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy