On the public citation graph

Nearly optimal solutions for the chow parameters problem and low-weight approximation of halfspaces

https://doi.org/10.1145/2213977.2214043
0 signed · 64 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.
Claim with ORCID
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.
See reference health

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/bf01268159openalex-snapshot
Regular simple games
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.1007/s00037-012-0045-5openalex-snapshot
Improved Approximation of Linear Threshold Functions
inferredcites →https://doi.org/10.1007/s001860400344openalex-snapshot
On the design of voting games
inferredcites →https://doi.org/10.1016/0016-0032(58)90688-4openalex-snapshot
An introduction to probability theory and its applications
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.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.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/focs.2009.26openalex-snapshot
Agnostic Learning of Monomials by Halfspaces Is Hard
inferredcites →https://doi.org/10.1109/inmic.2007.4557718openalex-snapshot
Efficient Algorithm for Designing Weighted Voting Games
inferredcites →https://doi.org/10.1109/pgec.1965.264254openalex-snapshot
Chebyshev Approximation and Threshold Functions
inferredcites →https://doi.org/10.1109/sfcs.1995.492584openalex-snapshot
Hard-core distributions for somewhat hard problems
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.1109/t-c.1970.223046openalex-snapshot
Enumeration of Threshold Functions of Eight Variables
inferredcites →https://doi.org/10.1111/j.1478-9299.2004.00001.xopenalex-snapshot
A Priori Voting Power: What is it All about?
inferredcites →https://doi.org/10.1137/0403015openalex-snapshot
Harmonic Analysis of Polynomial Threshold Functions
inferredcites →https://doi.org/10.1137/070707890openalex-snapshot
Testing Halfspaces
inferredcites →https://doi.org/10.1137/090756466openalex-snapshot
The Chow Parameters Problem
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/130385.130424openalex-snapshot
Toward efficient agnostic learning
inferredcites →https://doi.org/10.1145/2141938.2141940openalex-snapshot
Approximating Linear Threshold Predicates
inferredcites →https://doi.org/10.1145/238061.238098openalex-snapshot
On restricted-focus-of-attention learnability of Boolean functions
inferredcites →https://doi.org/10.1145/321637.321647openalex-snapshot
Chow Parameters in Threshold Logic
inferredcites →https://doi.org/10.1287/moor.4.2.99openalex-snapshot
Mathematical Properties of the Banzhaf Power Index
inferredcites →https://doi.org/10.21236/ad0452952openalex-snapshot
THRESHOLD FUNCTIONS THROUGH N=7
inferredcites →https://doi.org/10.22004/ag.econ.269461openalex-snapshot
Power Indices as an Aid to Institutional Design: The Generalised Apportionment Problem
inferredcites →https://doi.org/10.2307/2314609openalex-snapshot
An Introduction to Probability Theory and Its Applications.
inferredcites →https://doi.org/10.4007/annals.2009.169.595openalex-snapshot
Inverse Littlewood–Offord theorems and the condition number of random discrete matrices
inferredcites →https://doi.org/10.48550/arxiv.1202.6245openalex-snapshot
Heuristic and exact solutions to the inverse power index problem for small voting bodies
inferredcites →https://doi.org/10.5555/1838206.1838261openalex-snapshot
Enumeration and exact design of weighted voting games

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.2139/ssrn.2391113openalex-extracted
inferred← citeshttps://doi.org/10.2139/ssrn.2432875openalex-extracted
Ready for the Design of Voting Rules?
inferred← citeshttps://doi.org/10.1007/978-3-642-31594-7_23openalex-snapshot
The Inverse Shapley Value Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-39206-1_32openalex-snapshot
A Robust Khintchine Inequality, and Algorithms for Computing Optimal Constants in Fourier Analysis and High-Dimensional Geometry
inferred← citeshttps://doi.org/10.1007/s00355-015-0946-8openalex-snapshot
The inverse problem for power distributions in committees
inferred← citeshttps://doi.org/10.1007/s00440-017-0804-yopenalex-snapshot
A new central limit theorem and decomposition for Gaussian polynomials, with an application to deterministic approximate counting
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.1137/120868402openalex-snapshot
On the Weight of Halfspaces over Hamming Balls
inferred← citeshttps://doi.org/10.1145/2422436.2422440openalex-snapshot
Low-weight halfspaces for sparse boolean vectors
inferred← citeshttps://doi.org/10.1145/2591796.2591800openalex-snapshot
Efficient deterministic approximate counting for low-degree 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.1613/jair.4109openalex-snapshot
Finding Optimal Solutions for Voting Game Design Problems
inferred← citeshttps://doi.org/10.25148/etd.fidc010235openalex-snapshot
A Study of Sparse Representation of Boolean Functions
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.