The following pages link to Alexej P. Lisitsa (Q1662268):
Displayed 37 items.
- Item:Q1662268 (redirect page) (← links)
- Computer-aided proof of Erdős discrepancy properties (Q892235) (← links)
- \(\Delta\)-languages for sets and LOGSPACE computable graph transformers (Q1392148) (← links)
- The Andrews-Curtis conjecture, term rewriting and first-order proofs (Q1662269) (← links)
- Item:Q1662268 (redirect page) (← links)
- On one application of computations with oracle (Q1758675) (← links)
- Revisiting MU puzzle: a case study in finite countermodels verification (Q1798911) (← links)
- Linear ordering on graphs, anti-founded sets and polynomial time computability (Q1960423) (← links)
- \texttt{Gauss-lintel}, an algorithm suite for exploring chord diagrams (Q2128824) (← links)
- Finite reasons for safety (Q2351397) (← links)
- Verification as a parameterized testing (experiments with the SCP4 supercompiler) (Q2371554) (← links)
- Dihedral semigroups, their defining relations and an application to describing knot semigroups of rational links (Q2413512) (← links)
- Efficient Knot Discrimination via Quandle Coloring with SAT and #-SAT (Q2819199) (← links)
- Planarity of Knots, Register Automata and LogSpace Computability (Q3004597) (← links)
- A SAT Attack on the Erdős Discrepancy Conjecture (Q3192068) (← links)
- REACHABILITY ANALYSIS IN VERIFICATION VIA SUPERCOMPILATION (Q3526545) (← links)
- Automata on Gauss Words (Q3618609) (← links)
- On the Computational Power of Querying the History (Q3634005) (← links)
- COMPLEXITY OF UNIVERSAL CIRCUMSCRIPTION (Q4286111) (← links)
- (Q4376058) (← links)
- Automated Reasoning for Knot Semigroups and $$\pi $$ π -orbifold Groups of Knots (Q4628476) (← links)
- Reachability as Derivability, Finite Countermodels and Verification (Q4931295) (← links)
- Abstract State Machines and System Theoretic Process Analysis for Safety-Critical Systems (Q5045457) (← links)
- (Q5111907) (← links)
- Mathematical Foundations of Computer Science 2004 (Q5311135) (← links)
- Detecting Unknots via Equational Reasoning, I: Exploration (Q5495915) (← links)
- Visual Algebraic Proofs for Unknot Detection (Q5878863) (← links)
- Describing realizable Gauss diagrams using the concepts of parity or bipartite graphs (Q6064923) (← links)
- Correction to: ``Parameterized verification of leader/follower systems via first-order temporal logic'' (Q6102169) (← links)
- Representation and processing of instantaneous and durative temporal phenomena (Q6102256) (← links)
- A combinatorial approach to knot recognition (Q6262075) (← links)
- Experimental Mathematics Approach to Gauss Diagrams Realizability (Q6361986) (← links)
- Circle graphs (chord interlacement graphs) of Gauss diagrams: Descriptions of realizable Gauss diagrams, algorithms, enumeration (Q6374628) (← links)
- Untangling Braids with Multi-agent Q-Learning (Q6378938) (← links)
- An application of neural networks to a problem in knot theory and group theory (untangling braids) (Q6401746) (← links)
- Machine learning discovers invariants of braids and flat braids (Q6444772) (← links)
- Automated reasoning for proving non-orderability of groups (Q6454413) (← links)