article

Nondeterminism within P

Authors:

Jonathan F. Buss and

Judy GoldsmithAuthors Info & Claims

SIAM Journal on Computing, Volume 22, Issue 3

Pages 560 - 572

https://doi.org/10.1137/0222038

Published: 01 June 1993 Publication History

Abstract

No abstract available.

Cited By

View all

Williams RMohar BShinkar IO'Donnell R(2024)Self-Improvement for Circuit-Analysis ProblemsProceedings of the 56th Annual ACM Symposium on Theory of Computing10.1145/3618260.3649723(1374-1385)Online publication date: 10-Jun-2024
https://dl.acm.org/doi/10.1145/3618260.3649723
Aravind NSaxena R(2024)The Parameterized Complexity of Terminal Monitoring SetWALCOM: Algorithms and Computation10.1007/978-981-97-0566-5_7(76-90)Online publication date: 18-Mar-2024
https://dl.acm.org/doi/10.1007/978-981-97-0566-5_7
Bandyapadhyay SFriggstad ZMousavi R(2023)A Parameterized Approximation Scheme for Generalized Partial Vertex CoverAlgorithms and Data Structures10.1007/978-3-031-38906-1_7(93-105)Online publication date: 31-Jul-2023
https://dl.acm.org/doi/10.1007/978-3-031-38906-1_7
Show More Cited By

Index Terms

Nondeterminism within P
1. Mathematics of computing
  1. Mathematical analysis
    1. Numerical analysis
      1. Computations on polynomials
2. Theory of computation
  1. Computational complexity and cryptography
    1. Complexity classes

Recommendations

Determinism vs. nondeterminism for two-way automata: representing the meaning of states by logical formulæ
DLT'12: Proceedings of the 16th international conference on Developments in Language Theory

The question whether nondeterminism is more powerful than determinism for two-way automata is one of the most famous old open problems on the border between formal language theory and automata theory. An exponential gap between the number of states of ...
Read More
Nondeterminism versus determinism for two-way finite automata: generalizations of Sipser's separation
ICALP'03: Proceedings of the 30th international conference on Automata, languages and programming

Whether there exists an exponential gap between the size of a minimal deterministic two-way automaton and the size of a minimal nondeterministic two-way automaton for a specific regular language is a long standing open problem and surely one of the most ...
Read More
Descriptional and computational complexity of finite automata---A survey

Finite automata are probably best known for being equivalent to right-linear context-free grammars and, thus, for capturing the lowest level of the Chomsky-hierarchy, the family of regular languages. Over the last half century, a vast literature ...
Read More

Comments

Information & Contributors

Information

Published In

SIAM Journal on Computing Volume 22, Issue 3

June 1993

229 pages

ISSN:0097-5397

Editor:
Z. Galil
Columbia Univ., New York, NY and Tel-Aviv Univ., Tel-Aviv, Israel

Issue’s Table of Contents

Publisher

Society for Industrial and Applied Mathematics

United States

Publication History

Published: 01 June 1993

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

54
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Other Metrics

View Author Metrics

Citations

Cited By

View all

Williams RMohar BShinkar IO'Donnell R(2024)Self-Improvement for Circuit-Analysis ProblemsProceedings of the 56th Annual ACM Symposium on Theory of Computing10.1145/3618260.3649723(1374-1385)Online publication date: 10-Jun-2024
https://dl.acm.org/doi/10.1145/3618260.3649723
Aravind NSaxena R(2024)The Parameterized Complexity of Terminal Monitoring SetWALCOM: Algorithms and Computation10.1007/978-981-97-0566-5_7(76-90)Online publication date: 18-Mar-2024
https://dl.acm.org/doi/10.1007/978-981-97-0566-5_7
Bandyapadhyay SFriggstad ZMousavi R(2023)A Parameterized Approximation Scheme for Generalized Partial Vertex CoverAlgorithms and Data Structures10.1007/978-3-031-38906-1_7(93-105)Online publication date: 31-Jul-2023
https://dl.acm.org/doi/10.1007/978-3-031-38906-1_7
Golovach PKomusiewicz CKratsch DLe V(2022)Refined notions of parameterized enumeration kernels with applications to matching cut enumerationJournal of Computer and System Sciences10.1016/j.jcss.2021.07.005123:C(76-102)Online publication date: 1-Feb-2022
https://dl.acm.org/doi/10.1016/j.jcss.2021.07.005
Zehavi M(2022)Parameterized analysis and crossing minimization problemsComputer Science Review10.1016/j.cosrev.2022.10049045:COnline publication date: 1-Aug-2022
https://dl.acm.org/doi/10.1016/j.cosrev.2022.100490
Baste JFellows MJaffke LMasařík Tde Oliveira Oliveira MPhilip GRosamond F(2022)Diversity of solutionsArtificial Intelligence10.1016/j.artint.2021.103644303:COnline publication date: 1-Feb-2022
https://dl.acm.org/doi/10.1016/j.artint.2021.103644
Bang-Jensen JEiben EGutin GWahlström MYeo A(2022)Component Order Connectivity in Directed GraphsAlgorithmica10.1007/s00453-022-01004-z84:9(2767-2784)Online publication date: 1-Sep-2022
https://dl.acm.org/doi/10.1007/s00453-022-01004-z
Bannach MHeinrich ZReischuk RTantau T(2022)Dynamic Kernels for Hitting Sets and Set PackingAlgorithmica10.1007/s00453-022-00986-084:11(3459-3488)Online publication date: 1-Nov-2022
https://dl.acm.org/doi/10.1007/s00453-022-00986-0
Moscato PMathieson LHaque M(2021)Augmented intuition: a bridge between theory and practiceJournal of Heuristics10.1007/s10732-020-09465-727:4(497-547)Online publication date: 1-Aug-2021
https://dl.acm.org/doi/10.1007/s10732-020-09465-7
Biswas ARaman VSaurabh S(2021)Approximation in (Poly-) Logarithmic SpaceAlgorithmica10.1007/s00453-021-00826-783:7(2303-2331)Online publication date: 1-Jul-2021
https://dl.acm.org/doi/10.1007/s00453-021-00826-7
Show More Cited By

View Options

View options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Abstract

Cited By

Index Terms

Recommendations

Determinism vs. nondeterminism for two-way automata: representing the meaning of states by logical formulæ

Nondeterminism versus determinism for two-way finite automata: generalizations of Sipser's separation

Descriptional and computational complexity of finite automata---A survey

Comments

Information

Published In

Publisher

Publication History

Author Tags

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations