20 results for “Deterministic methods”
CS papers onlyHybrid search: Keyword + semantic, ranked by combined score.ⓘ
Want pure semantic search? Try claim verification →
A new method for finding roots of polynomials over finite fields in deterministic polynomial time.
This paper reviews models of inexact computational oracles in smooth continuous optimization and their implications for optimization algorithms.
The Euclidean shortest vector problem is deterministically NP-hard to approximate within any constant factor for arbitrary constants.
The paper presents a minimax-optimal multicalibration algorithm that outputs a deterministic predictor.
The authors introduce a quantum empirical operator and use it to prove a universal achievability result for composite quantum hypothesis testing.
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.
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.
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…
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…
The authors develop a deterministic polynomial-time algorithm for the Bilu--Linial signing problem on bipartite graphs.
This paper identifies a technical oversight in Mossel and Peres (2005) theorem on designing Bernoulli factories for multivariable functions and provides a counterexample.
This paper improves max-policy iteration by replacing mathematical optimization with value iteration and proposes min-policy iteration as an alternative to linear programming.