A Preliminary Overview of an Algorithm for Finding Opposites (Contradictions)

This is a preliminary overview of an algorithm for nding opposites (contradictions)and the mathematical expression of such an algorithm. Here we show only the main stages of thealgorithm, as well as the main applicable tools.

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-09-13
DOI
https://doi.org/10.5281/zenodo.22731439
Primary Topic
Polynomial and algebraic computation
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
preprint

A Preliminary Overview of an Algorithm for Finding Opposites (Contradictions)

Ruslan Nazarov
Zenodo (CERN European Organization for Nuclear Research)
Polynomial and algebraic computation
preprint

A Preliminary Overview of an Algorithm for Finding Opposites (Contradictions)

Ruslan Nazarov
preprint en

Abstract

This is a preliminary overview of an algorithm for nding opposites (contradictions)and the mathematical expression of such an algorithm. Here we show only the main stages of thealgorithm, as well as the main applicable tools.

Zenodo (CERN European Organization for Nuclear Research)
Polynomial and algebraic computation
DOIOpen Access PDFOpenAlex
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

A Preliminary Overview of an Algorithm for Finding Opposites (Contradictions) — Ruslan Nazarov · Zenodo (CERN European Organization for Nuclear Research) (2026) | TGRS Research Map | TGRS