Geometric sets of low information content

DOI10.1016/0304-3975(95)00073-9zbMath0871.68114OpenAlexW1983193090MaRDI QIDQ1351460

V. Arvind, Manindra Agrawal

Publication date: 27 February 1997

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(95)00073-9

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (2)

Weights of exact threshold functions ⋮ Dimension, halfspaces, and the density of hard sets

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Relations among MOD-classes
• On self-reducibility and weak P-selectivity
• Sparse complete sets for NP: solution of a conjecture of Berman and Hartmanis
• On sparse hard sets for counting classes
• A comparison of polynomial time reducibilities
• Approximable sets
• Self-reducibility
• Self-reducible sets of small density
• On relativized exponential and probabilistic complexity classes
• The Application of Multivariate Polynomials to Inference Rules and Partial Tests for Unsatisfiability
• Polynomial-Time Bounded Truth-Table Reducibility of NP Sets to Sparse Sets
• Algebraic methods for interactive proof systems
• IP = SPACE
• Polynomial-Time Membership Comparable Sets

This page was built for publication: Geometric sets of low information content