scientific article; zbMATH DE number 1833419
From MaRDI portal
Publication:4780800
zbMath0998.68076MaRDI QIDQ4780800
Michal Parnas, Dana Ron, Ronitt Rubinfeld
Publication date: 21 November 2002
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2129/21290261
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Nonnumerical algorithms (68W05) Formal languages and automata (68Q45)
Related Items (4)
Proofs of Proximity for Context-Free Languages and Read-Once Branching Programs ⋮ Proofs of proximity for context-free languages and read-once branching programs ⋮ A lower bound for testing juntas ⋮ \(\omega\)-regular languages are testable with a constant number of queries
This page was built for publication:
