On Universally Polynomial Context-Free Languages

Authors:
Nicholas Tran
Affiliations:
-
Venue:
COCOON '01 Proceedings of the 7th Annual International Conference on Computing and Combinatorics
Year:
2001

Citing 6
Cited 0

On sparseness, ambiguity and other decision problems for acceptors and transducers

3rd annual symposium on theoretical aspects of computer science on STACS 86
Structural complexity 1

Structural complexity 1
On universally easy classes for NP-complete problems

SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Introduction To Automata Theory, Languages, And Computation

Introduction To Automata Theory, Languages, And Computation
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
lambda-Coloring of Graphs

STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

A language is universally polynomial if its intersection with every NP-complete language is in P. Such a language would provide an automatic method for generating easy instances of intractable problems. In this note, we give a complete characterization of universally polynomial languages that are context-free, answering an open question in [4].