Search results for "monomials"

Found 219 publication records. Showing 219 according to the selection in the facets

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
14	Markus Bläser	Improvements of the Alder-Strassen Bound: Algebras with Nonzero Radical.	ICALP	2001	DBLP DOI BibTeX RDF
14	Markus Bläser	Computing Reciprocals of Bivariate Power Series.	MFCS	2001	DBLP DOI BibTeX RDF
14	Michal Parnas, Dana Ron, Alex Samorodnitsky	Proclaiming Dictators and Juntas or Testing Boolean Formulae.	RANDOM-APPROX	2001	DBLP DOI BibTeX RDF
14	Hwankoo Kim, Sang-Jae Moon	New Public-Key Cryptosystem Using Divisor Class Groups.	ACISP	2001	DBLP DOI BibTeX RDF
14	Jürgen Forster, Niels Schmitt, Hans Ulrich Simon	Estimating the Optimal Margins of Embeddings in Euclidean Half Spaces.	COLT/EuroCOLT	2001	DBLP DOI BibTeX RDF
14	Adam R. Klivans, Daniel A. Spielman	Randomness efficient identity testing of multivariate polynomials.	STOC	2001	DBLP DOI BibTeX RDF
14	Erion Plaku, Igor E. Shparlinski	On Polynomial Representations of Boolean Functions Related to Some Number Theoretic Problems.	FSTTCS	2001	DBLP DOI BibTeX RDF
14	Amir Shpilka	Affine Projections of Symmetric Polynomials.	CCC	2001	DBLP DOI BibTeX RDF
14	Parampalli Udaya, M. U. Siddiqi	Generalized GMW Quadriphase Sequences Satisfying the Welch Bound with Equality.	Appl. Algebra Eng. Commun. Comput.	2000	DBLP DOI BibTeX RDF	Quadriphase sequences, Nonlinear polynomial mappings, GGMW sequences, Spread spectrum systems, CDMA, Linear complexity, Galois rings, Pseudo random sequences, Sequence design, Finite rings
14	Saugata Basu	On Bounding the Betti Numbers and Computing the Euler Characteristic of Semi-Algebraic Sets.	Discret. Comput. Geom.	1999	DBLP DOI BibTeX RDF
14	Piotr Ejdys, Grzegorz Góra	The More We Learn the Less We Know? On Inductive Learning from Examples.	ISMIS	1999	DBLP DOI BibTeX RDF
14	Jung Hee Cheon, Seongtaek Chee, Choonsik Park	S-boxes with Controllable Nonlinearity.	EUROCRYPT	1999	DBLP DOI BibTeX RDF
14	Stasys Jukna, Alexander A. Razborov, Petr Savický, Ingo Wegener	On O versus NP \cap co-NP for Decision Trees and Read-Once Branching Programs.	MFCS	1997	DBLP DOI BibTeX RDF
14	Marcus Schäfer 0001	Deciding the Vapnik-Cervonenkis dimension is SigmaP3-complete.	CCC	1996	DBLP DOI BibTeX RDF	computational complexity, VC dimension
14	Thomas R. Hancock, Tao Jiang 0001, Ming Li 0001, John Tromp	Lower Bounds on Learning Decision Lists and Trees (Extended Abstract).	STACS	1995	DBLP DOI BibTeX RDF
14	Ted Stanion, Carl Sechen	Quasi-algebraic decompositions of switching functions.	ARVLSI	1995	DBLP DOI BibTeX RDF	quasi-algebraic decompositions, algebraic product, binary Boolean operation, canonical manner, SSL testable, logic testing, testability, switching functions, switching functions, state assignment, minimisation of switching nets, benchmark circuits, circuit size
14	Michael J. Kearns, Ming Li 0001, Leslie G. Valiant	Learning Boolean Formulas.	J. ACM	1994	DBLP DOI BibTeX RDF	machine learning, inductive inference
14	Leonard Pitt, Leslie G. Valiant	Computational limitations on learning from examples.	J. ACM	1988	DBLP DOI BibTeX RDF
14	Katja Lenz, Ingo Wegener	The Conjunctive Complexity of Quadratic Boolean Functions.	CSL	1987	DBLP DOI BibTeX RDF

Displaying result #201 - #219 of 219 (100 per page; Change: )
Pages: [<<][1][2][3]