English
Related papers

Related papers: Testing Linear-Invariant Non-Linear Properties

200 papers

This paper develops and implements a nonparametric test of Random Utility Models. The motivating application is to test the null hypothesis that a sample of cross-sectional demand distributions was generated by a population of rational…

Statistics Theory · Mathematics 2018-12-06 Yuichi Kitamura , Jörg Stoye

In this paper we initiate the study of \emph{property testing of weighted computational networks viewed as computational devices}. Our goal is to design property testing algorithms that for a given computational network with oracle access…

Data Structures and Algorithms · Computer Science 2025-12-09 Artur Czumaj , Christian Sohler

Let F be a finite extension of Qp and G be GL(2,F). When V is the tensor product of three admissible, irreducible, finite dimensional representations of G, the space of G-invariant linear forms has dimension at most one. When a non zero…

Number Theory · Mathematics 2008-10-13 Mladen Dimitrov , Louise Nyssen

We consider graph property testing in $p$-degenerate graphs under the random neighbor oracle model (Czumaj and Sohler, FOCS 2019). In this framework, a tester explores a graph by sampling uniform neighbors of vertices, and a property is…

Data Structures and Algorithms · Computer Science 2026-04-07 Oded Lachish , Amit Levi , Ilan Newman , Felix Reidl

Let $\sigma_i$, $i=1,\ldots,n$, denote positive Borel measures on $\mathbb{R}^d$, let $\mathcal{D}$ denote the usual collection of dyadic cubes in $\mathbb{R}^d$ and let $K:\,\mathcal{D}\to[0,\infty)$ be a~map. In this paper we give…

Classical Analysis and ODEs · Mathematics 2015-01-13 Hitoshi Tanaka

A graph property P is strongly testable if for every fixed \epsilon>0 there is a one-sided \epsilon-tester for P whose query complexity is bounded by a function of \epsilon. In classifying the strongly testable graph properties, the first…

Combinatorics · Mathematics 2011-10-14 Noga Alon , Jacob Fox

We are interested in verifying dynamic properties of finite state reactive systems under fairness assumptions by model checking. The systems we want to verify are specified through a top-down refinement process. In order to deal with the…

Logic in Computer Science · Computer Science 2011-11-10 Samir Chouali , Jacques Julliand , Pierre-Alain Masson , Françoise Bellegarde

We give a $\mathrm{poly}(\log n, 1/\epsilon)$-query adaptive algorithm for testing whether an unknown Boolean function $f: \{-1,1\}^n \to \{-1,1\}$, which is promised to be a halfspace, is monotone versus $\epsilon$-far from monotone. Since…

Computational Complexity · Computer Science 2017-06-20 Xi Chen , Rocco A. Servedio , Li-Yang Tan , Erik Waingarten

A banded matrix is a real square matrix where nonzero entries appear around the main diagonal. In this article, we consider linear complementarity properties of (variants) of banded matrices. Focusing on triangular matrices and the newly…

Optimization and Control · Mathematics 2026-03-12 Samapti Pratihar , M. Seetharama Gowda , K. C. Sivakumar

Let f:{-1,1}^n -> R be a real function on the hypercube, given by its discrete Fourier expansion, or, equivalently, represented as a multilinear polynomial. We say that it is Boolean if its image is in {-1,1}. We show that every function on…

Discrete Mathematics · Computer Science 2013-11-13 Tom Gur , Omer Tamuz

We describe a $\tilde{O}(d^{5/6})$-query monotonicity tester for Boolean functions $f:[n]^d \to \{0,1\}$ on the $n$-hypergrid. This is the first $o(d)$ monotonicity tester with query complexity independent of $n$. Motivated by this…

Discrete Mathematics · Computer Science 2019-12-11 Hadley Black , Deeparnab Chakrabarty , C. Seshadhri

Testing the validity of probabilistic models containing unmeasured (hidden) variables is shown to be a hard task. We show that the task of testing whether models are structurally incompatible with the data at hand, requires an exponential…

Artificial Intelligence · Computer Science 2013-02-28 Dan Geiger , Azaria Paz , Judea Pearl

Hyperproperties are properties of systems that relate multiple computation traces, including security and concurrency properties. This paper introduces a bounded model checking (BMC) algorithm for hyperproperties expressed in HyperLTL,…

Formal Languages and Automata Theory · Computer Science 2020-10-19 Tzu-Han Hsu , Cesar Sanchez , Borzoo Bonakdarpour

Linear network coding transmits data through networks by letting the intermediate nodes combine the messages they receive and forward the combinations towards their destinations. The solvability problem asks whether the demands of all the…

Information Theory · Computer Science 2014-12-18 Maximilien Gadouleau , Adrien Richard , Eric Fanchon

An explicit algorithm is presented for testing whether two non-directed graphs are isomorphic or not. It is shown that for a graph of n vertices, the number of n independent operations needed for the test is polynomial in n. A proof that…

Data Structures and Algorithms · Computer Science 2007-05-23 Moshe Schwartz

We deal with the problem of designing one-sided error property testers for cycle-freeness in bounded degree graphs. Such a property tester always accepts forests. Furthermore, when it rejects an input, it provides a short cycle as a…

Data Structures and Algorithms · Computer Science 2009-06-30 C. Seshadhri

Classification of Non-linear Boolean functions is a long-standing problem in the area of theoretical computer science. In this paper, effort has been made to achieve a systematic classification of all n-variable Boolean functions, where…

Logic in Computer Science · Computer Science 2013-03-15 Ranjeet Kumar Rout , Pabitra Pal Choudhury , Sudhakar Sahoo

We consider the problem of testing whether an unknown Boolean function $f$ is monotone versus $\epsilon$-far from every monotone function. The two main results of this paper are a new lower bound and a new algorithm for this well-studied…

Computational Complexity · Computer Science 2014-12-19 Xi Chen , Rocco A. Servedio , Li-Yang Tan

The characterization of covariate effects on model parameters is a crucial step during pharmacokinetic/pharmacodynamic analyses. While covariate selection criteria have been studied extensively, the choice of the functional relationship…

Methodology · Statistics 2024-04-09 Niklas Hartung , Martin Wahl , Abhishake Rastogi , Wilhelm Huisinga

In a recent work (ECCC, TR18-171, 2018), we introduced models of testing graph properties in which, in addition to answers to the usual graph-queries, the tester obtains {\em random vertices drawn according to an arbitrary distribution…

Data Structures and Algorithms · Computer Science 2019-06-06 Oded Goldreich
‹ Prev 1 4 5 6 7 8 10 Next ›