The following pages link to Nondeterministic Algorithms (Q5532796):
Displaying 43 items.
- Amorphous computing: examples, mathematics and theory (Q272778) (← links)
- Formal correctness proofs of a nondeterministic program (Q594577) (← links)
- The temporal logic of branching time (Q789895) (← links)
- Agent planning programs (Q899440) (← links)
- A logic language for combinatorial optimization (Q918429) (← links)
- Ten years of Hoare's logic: A survey. II: Nondeterminism (Q1056534) (← links)
- L.P.L. A fuzzy programming language. I: Syntactic aspects (Q1136234) (← links)
- L.P.L. - A fuzzy programming language. II: Semantic aspects (Q1141483) (← links)
- Nondeterministic flowchart programs with recursive procedures: Semantics and correctness. I (Q1143165) (← links)
- Nondeterministic flowchart programs with recursive procedures: Semantics and correctness. II (Q1152704) (← links)
- Some applications of the L.P.L. language to combinatorial programming (Q1158775) (← links)
- An execution mechanism for nondeterministic, state-oriented programs based on a chart parser (Q1209991) (← links)
- Interpretation of non-deterministic algorithms in higher-level languages (Q1215263) (← links)
- Fuzzy and probabilistic programs (Q1229093) (← links)
- Consistency in networks of relations (Q1231783) (← links)
- Backtracking in recursive computations (Q1238623) (← links)
- A structured program to generate all topological sorting arrangements (Q1393277) (← links)
- Angelic processes for CSP via the UTP (Q1757156) (← links)
- A unifying logic for non-deterministic, parallel and concurrent abstract state machines (Q1783738) (← links)
- A unification of probabilistic choice within a design-based model of reversible computation (Q1941891) (← links)
- Quantum algorithm for the multicollision problem (Q2006780) (← links)
- Slidex attacks on the Even-Mansour encryption scheme (Q2018815) (← links)
- MiniCP: a lightweight solver for constraint programming (Q2246188) (← links)
- Naive configurations (Q2249798) (← links)
- General correctness: A unification of partial and total correctness (Q2265798) (← links)
- Cryptanalysis of MD2 (Q2267363) (← links)
- Efficient slide attacks (Q2413611) (← links)
- The correctness of nondeterministic programs (Q2541847) (← links)
- REF-ARF: A system for solving problems stated as procedures (Q2541849) (← links)
- Mathematical theory of partial correctness (Q2545842) (← links)
- Reversible computing from a programming language perspective (Q2693633) (← links)
- A New Algorithm for the Unbalanced Meet-in-the-Middle Problem (Q2958141) (← links)
- Cryptanalysis of MDC-2 (Q3627430) (← links)
- Improved Cryptanalysis of the Common Scrambling Algorithm Stream Cipher (Q3634487) (← links)
- Formal computations of non deterministic recursive program schemes (Q3883492) (← links)
- Semantic and syntactic issues in programming (Q4076741) (← links)
- A search strategy for the elementary cycles of a directed graph (Q4096432) (← links)
- Non-deterministic programming (Q5532795) (← links)
- Control extension in a recursive language (Q5666173) (← links)
- Fifty Years of Prolog and Beyond (Q6063890) (← links)
- A closer look at the S-box: deeper analysis of round-reduced ASCON-HASH (Q6620030) (← links)
- Generic MitM attack frameworks on sponge constructions (Q6652908) (← links)
- Speeding up preimage and key-recovery attacks with highly biased differential-linear approximations (Q6652910) (← links)
