ArXivCSExplorer
☆☆Bookmarks🏆RSSHow to UseFAQ
Built with and by Teycir Ben Soltane•
How to Use•FAQ•GitHub•arXiv.org•
Share:

20 results for “Deterministic methods”

CS papers only

Hybrid search: Keyword + semantic, ranked by combined score.ⓘ

Want pure semantic search? Try claim verification →

cs.SCcs.CCmath.NTTheoreticalRecentOct 23, 2026

Deterministic Root-Finding over Finite Fields with Elliptic Curves

Pierre-Jean Spaenlehauer

A new method for finding roots of polynomials over finite fields in deterministic polynomial time.

View →
math.OCcs.CCcs.LGSurveyRecentOct 29, 2026

Stochastic and Noisy Oracles in Smooth Continuous Optimization

Albert S. Berahas, Liyuan Cao, Katya Scheinberg

This paper reviews models of inexact computational oracles in smooth continuous optimization and their implications for optimization algorithms.

View →
cs.CCmath.NTTheoreticalRecentAug 12, 2026

Euclidean SVP is deterministically NP-hard to approximate within any constant factor

Daqing Wan

The Euclidean shortest vector problem is deterministically NP-hard to approximate within any constant factor for arbitrary constants.

View →
cs.LGmath.STstat.MLTheoreticalRecentJun 18, 2026

Optimal Deterministic Multicalibration and Omniprediction

Georgy Noarov, Aaron Roth

The paper presents a minimax-optimal multicalibration algorithm that outputs a deterministic predictor.

View →
cs.ITquant-phTheoreticalRecentJun 25, 2026

A Quantum Method of Types

Arick Grootveld

The authors introduce a quantum empirical operator and use it to prove a universal achievability result for composite quantum hypothesis testing.

View →
cs.AIcs.CRMar 26, 2026

On the Foundations of Trustworthy Artificial Intelligence

TJ Dunham

The paper proves that platform-deterministic inference is a necessary and sufficient condition for trustworthy AI, establishing that AI trust fundamentally relies on consistent arithmetic.

View →
cs.LOcs.PLEmpiricalRecentJun 26, 2026

KoAT: Automatic Complexity and Termination Analysis of Integer Programs

Nils Lommen, Éléanore Meyer, Jürgen Giesl

KoAT is a tool that automatically infers complexity bounds and proves termination of integer programs using an alternating modular analysis approach and a portfolio of techniques.

View →
cs.LGcs.AIcs.DCRecentJun 1, 2026

Post-Deterministic Distributed Systems: A New Foundation for Trustworthy Autonomous Infrastructure

Jun He, Deying Yu

The paper introduces Post-Deterministic Distributed Systems (PDDS) as a new model to coordinate autonomous infrastructure where participants, including stochastic agents, produce divergent reasoning p…

View →
cs.DSTheoreticalRecentAug 4, 2026

Bottleneck Paths Reduce to Deterministic Graphical Games: A Correction to a Claimed Linear-Time Algorithm

Egor Gorbachev

This paper provides a counterexample to a claimed linear-time comparison-based algorithm for solving deterministic graphical games (DGGs) and gives a deterministic linear-time reduction from the direc…

View →
cs.DScs.CCmath.COTheoreticalRecentOct 7, 2026

A deterministic algorithm for signing bipartite graphs at the Ramanujan bound

Zhiqiang Xu

The authors develop a deterministic polynomial-time algorithm for the Bilu--Linial signing problem on bipartite graphs.

View →
math.PRcs.DMcs.FLTheoreticalRecentJun 28, 2026

Note on Finite-Automata Bernoulli Factories for Rational Functions

Renato Paes Leme, Jon Schneider

This paper identifies a technical oversight in Mossel and Peres (2005) theorem on designing Bernoulli factories for multivariable functions and provides a counterexample.

View →
cs.PLmath.OCTheoreticalRecentJun 9, 2026

Max-Policy Iteration, Revisited

David Monniaux, Helmut Seidl

This paper improves max-policy iteration by replacing mathematical optimization with value iteration and proposes min-policy iteration as an alternative to linear programming.

View →