Live briefing
Everything about Nondeterministic algorithm
Algorithm whose behavior and output may depend on the run
In computer science and computer programming, a nondeterministic algorithm is an algorithm that, even for the same input, can exhibit different behaviors on different runs, as opposed to a deterministic algorithm. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Nondeterministic algorithmA 5-minute orientation
- Skim a recent paper: Joint Traffic Routing and Scheduling Algorithm Eliminating the Nondeterministic Interruption for TSN Networks Used in IIoTInfluential work since 2022
- Pick up a classic book: Artificial intelligenceThe most-reprinted book on the subject
- Read the landmark paper: Nondeterministic AlgorithmsCited 242 times
- Go sideways: NL (complexity)A closely related topic
- Go sideways: Randomized algorithmA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
Nondeterministic Algorithms
A Nondeterministic Parallel Algorithm for General Unsymmetric Sparse LU Factorization
Action-Curiosity-Based Deep Reinforcement Learning Algorithm for Path Planning in a Nondeterministic Environment
A new algorithm of the state-minimization for the nondeterministic finite automata
Algorithmic logic with nondeterministic programs1
Bisimilarity control of partially observed nondeterministic discrete event systems and a test algorithm
Division Charts as Granules and Their Merging Algorithm for Rule Generation in Nondeterministic Data
Nondeterministic Moore automata and Brzozowski’s minimization algorithm
🆕 Influential since 2022
Joint Traffic Routing and Scheduling Algorithm Eliminating the Nondeterministic Interruption for TSN Networks Used in IIoT
Efficient algorithms for computing bisimulations for nondeterministic fuzzy transition systems
SYNTHESIS OF NONDETERMINISTIC FINITE AUTOMATON FROM REGULAR EXPRESSIONS BY GLUSHKOV'S ALGORITHM IN JFF FORMAT
Nondeterministic polynomial time algorithm for estimation of space launch base launch capacity
A nondeterministic branch-and-bound algorithm for maximizing the sum of a generalized Rayleigh quotient and a quadratic form on the unit sphere
📚 Books worth reading
Artificial intelligenceStuart J. Russell, Peter Norvig · 1994
An introduction to formal languages and automataPeter Linz · 1990
Introduction to automata theory, languages, and computationJohn E. Hopcroft, Jeffrey D. Ullman · 1979
Principles of Distributed SystemsRoberto Baldoni · 2012
Computer algorithmsEllis Horowitz · 1997
AI for Game DevelopersDavid M. Bourg, Glenn Seemann · 2004
Theoretical foundations of computer scienceDino Mandrioli · 1987
ICT in Education, Research, and Industrial ApplicationsVadim Ermolayev · 2013
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- NL (complexity) Unsolved problem in computer science 𝖫=?𝖭𝖫 More unsolved problems in computer science In computational complexity theory, NL (Nondeterministic Logarithmic-spa…
- Randomized algorithm A randomized algorithm is an algorithm that employs a degree of randomness as part of its logic or procedure. The algorithm typically uses uniformly random…
- Complexity class In computational complexity theory, a complexity class is a set of computational problems "of related resource-based complexity". The two most commonly…
- BPP (complexity) In computational complexity theory, a branch of computer science, bounded-error probabilistic polynomial time (BPP) is the class of decision problems solvable…
- Random-access Turing machine In computational complexity, a field of theoretical computer science, random-access Turing machines extend the functionality of conventional Turing machines…
- Deterministic finite automaton In the theory of computation, a branch of theoretical computer science, a deterministic finite automaton (DFA) is a finite-state machine that accepts or…
- Model of computation In computer science, and more specifically in computability theory and computational complexity theory, a model of computation is a model that describes…
- Self-verifying finite automaton In automata theory, a self-verifying finite automaton (SVFA) is a special kind of a nondeterministic finite automaton (NFA) with a symmetric kind of nondetermin…