On the public citation graph
Nearly Optimal Solutions for the Chow Parameters Problem and Low-Weight Approximation of Halfspaces
0 signed · 68 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1006/inco.1995.1095openalex-snapshot
Vector Analysis of Threshold Functions
inferredcites →https://doi.org/10.1006/jcss.1998.1569openalex-snapshot
Learning with Restricted Focus of Attention
inferredcites →https://doi.org/10.1007/978-3-642-31594-7_23openalex-snapshot
The Inverse Shapley Value Problem
inferredcites →https://doi.org/10.1007/bf00993468openalex-snapshot
Toward efficient agnostic learning
inferredcites →https://doi.org/10.1007/bf01121471openalex-snapshot
Refinement of the upper bound of the constant in the central limit theorem
inferredcites →https://doi.org/10.1007/bf02018403openalex-snapshot
Estimates for the concentration function of combinatorial number theory and probability
inferredcites →https://doi.org/10.1007/bf02568549openalex-snapshot
Different ways to represent weighted majority games
inferredcites →https://doi.org/10.1007/s00037-007-0228-7openalex-snapshot
Every Linear Threshold Function has a Low-Weight Approximator
inferredcites →https://doi.org/10.1016/0097-3165(88)90046-5openalex-snapshot
On subspaces spanned by random selections of ±1 vectors
inferredcites →https://doi.org/10.1016/s0019-9958(63)80014-5openalex-snapshot
A geometric test-synthesis procedure for a threshold device
inferredcites →https://doi.org/10.1016/s0304-3975(01)00092-5openalex-snapshot
On two-sided infinite fixed points of morphisms
inferredcites →https://doi.org/10.1023/a:1004965310450openalex-snapshot
Is the allocation of voting power among EU states fair?
inferredcites →https://doi.org/10.1023/a:1007458528570openalex-snapshot
On Restricted-Focus-of-Attention Learnability of Boolean Functions
inferredcites →https://doi.org/10.1023/a:1016324824094openalex-snapshot
Voting Power in the Governance of the International Monetary Fund
inferredcites →https://doi.org/10.1023/a:1020877015060openalex-snapshot
Designing the Voting System for the Council of the European Union
inferredcites →https://doi.org/10.1080/02331934.2011.587008openalex-snapshot
On the inverse power index problem
inferredcites →https://doi.org/10.1090/s0002-9939-1972-0287916-7openalex-snapshot
The Counting Vector of a Simple Game
inferredcites →https://doi.org/10.1090/s0002-9939-1992-1092927-0openalex-snapshot
A Characterization of Weighted Voting
inferredcites →https://doi.org/10.1090/s0025-5718-62-99195-0openalex-snapshot
Majority Decision Functions of up to Six Variables
inferredcites →https://doi.org/10.1093/comjnl/16.2.165openalex-snapshot
The application of Chow parameters and Rademacher-Walsh matrices in the synthesis of binary functions
inferredcites →https://doi.org/10.1109/ccc.2009.41openalex-snapshot
Regularity, Boosting, and Efficiently Simulating Every High-Entropy Distribution
inferredcites →https://doi.org/10.1109/ccc.2009.8openalex-snapshot
Improved Approximation of Linear Threshold Functions
inferredcites →https://doi.org/10.1109/focs.1961.24openalex-snapshot
On the characterization of threshold functions
inferredcites →https://doi.org/10.1109/focs.1961.39openalex-snapshot
Truth functions realizable by single threshold organs
inferredcites →https://doi.org/10.1109/pgec.1965.264254openalex-snapshot
Chebyshev Approximation and Threshold Functions
inferredcites →https://doi.org/10.1109/sfcs.2005.13openalex-snapshot
Agnostically Learning Halfspaces
inferredcites →https://doi.org/10.1109/swat.1973.4openalex-snapshot
Chow parameters in pseudothreshold logic
inferredcites →https://doi.org/10.1109/t-c.1969.222665openalex-snapshot
Threshold Gate Approximations Based on Chow Parameters
inferredcites →https://doi.org/10.1137/0403015openalex-snapshot
Harmonic Analysis of Polynomial Threshold Functions
inferredcites →https://doi.org/10.1137/100783030openalex-snapshot
Bounded Independence Fools Halfspaces
inferredcites →https://doi.org/10.1137/s0895480103426765openalex-snapshot
A Bound on the Precision Required to Estimate a Boolean Perceptron from Its Average Satisfying Assignment
inferredcites →https://doi.org/10.1137/s0895480192235878openalex-snapshot
On the Size of Weights for Threshold Gates
inferredcites →https://doi.org/10.1145/321637.321647openalex-snapshot
Chow Parameters in Threshold Logic
inferredcites →https://doi.org/10.2307/2981392openalex-snapshot
The Elementary Statistics of Majority Voting
inferredcites →https://doi.org/10.4007/annals.2009.169.595openalex-snapshot
Inverse Littlewood–Offord theorems and the condition number of random discrete matrices
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-030-79416-3_28openalex-snapshot
A Generalization of a Theorem of Rothschild and van Lint
inferred← citeshttps://doi.org/10.1007/978-3-031-78023-3_17openalex-snapshot
Reducing the Share Size of Weighted Threshold Secret Sharing Schemes via Chow Parameters Approximation
inferred← citeshttps://doi.org/10.1007/978-3-319-66939-7_13openalex-snapshot
Generation of Reducts and Threshold Functions Using Discernibility and Indiscernibility Matrices for Classification
inferred← citeshttps://doi.org/10.1007/978-981-16-2380-6_31openalex-snapshot
Iterative Generation of Chow Parameters Using Nearest Neighbor Relations in Threshold Network
inferred← citeshttps://doi.org/10.1007/s11128-018-1885-yopenalex-snapshot
Quantum algorithms on Walsh transform and Hamming distance for Boolean functions
inferred← citeshttps://doi.org/10.1016/j.geb.2017.06.004openalex-snapshot
The Inverse Shapley value problem
inferred← citeshttps://doi.org/10.1016/j.tcs.2023.113802openalex-snapshot
A generalization of a theorem of Rothschild and van Lint
inferred← citeshttps://doi.org/10.1109/acit-csii-bcd.2017.24openalex-snapshot
Characterization and Generation of Threshold Functions Based on Nearest Neighbor Relations
inferred← citeshttps://doi.org/10.1109/ccc.2014.31openalex-snapshot
Deterministic Approximate Counting for Juntas of Degree-2 Polynomial Threshold Functions
inferred← citeshttps://doi.org/10.1109/ismvl.2017.53openalex-snapshot
Nomura Parameters for S-Threshold Functions
inferred← citeshttps://doi.org/10.1109/sera.2017.7965707openalex-snapshot
Generation of reducts and threshold functions using discernibility and indiscerniblity matrices
inferred← citeshttps://doi.org/10.1142/s0129065721500453openalex-snapshot
Generation of Chow Parameters and Reduced Variables Through Nearest Neighbor Relations in Threshold Networks
inferred← citeshttps://doi.org/10.1145/2764468.2764538openalex-snapshot
Public Projects, Boolean Functions, and the Borders of Border's Theorem
inferred← citeshttps://doi.org/10.1145/3188745.3188754openalex-snapshot
Learning geometric concepts with nasty noise
inferred← citeshttps://doi.org/10.1145/3274645openalex-snapshot
Public Projects, Boolean Functions, and the Borders of Border’s Theorem
inferred← citeshttps://doi.org/10.1145/3313276.3316301openalex-snapshot
Degree-𝑑 chow parameters robustly determine degree-𝑑 PTFs (and algorithmic applications)
inferred← citeshttps://doi.org/10.1145/3618260.3649776openalex-snapshot
Super Non-singular Decompositions of Polynomials and Their Application to Robustly Learning Low-Degree PTFs
inferred← citeshttps://doi.org/10.14288/1.0043373openalex-snapshot
Deterministic Approximate Counting for Degree-2 Polynomial Threshold Functions
inferred← citeshttps://doi.org/10.1609/aaai.v33i01.33011869openalex-snapshot
On the Complexity of the Inverse Semivalue Problem for Weighted Voting Games
inferred← citeshttps://doi.org/10.2139/ssrn.2432875openalex-snapshot
Ready for the Design of Voting Rules?
inferred← citeshttps://doi.org/10.23919/date48585.2020.9116316openalex-snapshot
Pitfalls in Machine Learning-based Adversary Modeling for Hardware Systems
inferred← citeshttps://doi.org/10.25148/etd.fidc010235openalex-snapshot
A Study of Sparse Representation of Boolean Functions
inferred← citeshttps://doi.org/10.32604/cmc.2022.020103openalex-snapshot
A Quantum Algorithm for Evaluating the Hamming Distance
inferred← citeshttps://doi.org/10.4230/lipics.ccc.2018.2openalex-snapshot
A PRG for Boolean PTF of Degree 2 with Seed Length Subpolynomial in epsilon and Logarithmic in n
inferred← citeshttps://doi.org/10.48550/arxiv.1811.03491openalex-snapshot
Degree-$d$ Chow Parameters Robustly Determine Degree-$d$ PTFs (and Algorithmic Applications)
inferred← citeshttps://doi.org/10.48550/arxiv.1908.11335openalex-snapshot
Nearly Tight Bounds for Robust Proper Learning of Halfspaces with a Margin
inferred← citeshttps://doi.org/10.48550/arxiv.1911.00178openalex-snapshot
Kruskal-Katona for convex sets, with applications
inferred← citeshttps://doi.org/10.48550/arxiv.2005.12844openalex-snapshot
Approximation Schemes for ReLU Regression
inferred← citeshttps://doi.org/10.48550/arxiv.2103.16811openalex-snapshot
A Generalization of a Theorem of Rothschild and van Lint
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.