|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 100 occurrences of 86 keywords
|
|
|
Results
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 28th International Colloquium, ICALP 2001, Crete, Greece, July 8-12, 2001, Proceedings, pp. 79-91, 2001, Springer, 3-540-42287-0. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
14 | Markus Bläser |
Computing Reciprocals of Bivariate Power Series. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 2001, 26th International Symposium, MFCS 2001 Marianske Lazne, Czech Republic, August 27-31, 2001, Proceedings, pp. 186-197, 2001, Springer, 3-540-42496-2. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
14 | Michal Parnas, Dana Ron, Alex Samorodnitsky |
Proclaiming Dictators and Juntas or Testing Boolean Formulae. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RANDOM-APPROX ![In: Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques, 4th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2001 and 5th International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM 2001 Berkeley, CA, USA, August 18-20, 2001, Proceedings, pp. 273-284, 2001, Springer, 3-540-42470-9. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
14 | Hwankoo Kim, Sang-Jae Moon |
New Public-Key Cryptosystem Using Divisor Class Groups. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACISP ![In: Information Security and Privacy, 6th Australasian Conference, ACISP 2001, Sydney, Australia, July 11-13, 2001, Proceedings, pp. 74-83, 2001, Springer, 3-540-42300-1. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
14 | Jürgen Forster, Niels Schmitt, Hans Ulrich Simon |
Estimating the Optimal Margins of Embeddings in Euclidean Half Spaces. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COLT/EuroCOLT ![In: Computational Learning Theory, 14th Annual Conference on Computational Learning Theory, COLT 2001 and 5th European Conference on Computational Learning Theory, EuroCOLT 2001, Amsterdam, The Netherlands, July 16-19, 2001, Proceedings, pp. 402-415, 2001, Springer, 3-540-42343-5. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
14 | Adam R. Klivans, Daniel A. Spielman |
Randomness efficient identity testing of multivariate polynomials. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings on 33rd Annual ACM Symposium on Theory of Computing, July 6-8, 2001, Heraklion, Crete, Greece, pp. 216-223, 2001, ACM, 1-58113-349-9. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
14 | Erion Plaku, Igor E. Shparlinski |
On Polynomial Representations of Boolean Functions Related to Some Number Theoretic Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: FST TCS 2001: Foundations of Software Technology and Theoretical Computer Science, 21st Conference, Bangalore, India, December 13-15, 2001, Proceedings, pp. 305-316, 2001, Springer, 3-540-43002-4. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
14 | Amir Shpilka |
Affine Projections of Symmetric Polynomials. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the 16th Annual IEEE Conference on Computational Complexity, Chicago, Illinois, USA, June 18-21, 2001, pp. 160-171, 2001, IEEE Computer Society, 0-7695-1053-1. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
14 | Parampalli Udaya, M. U. Siddiqi |
Generalized GMW Quadriphase Sequences Satisfying the Welch Bound with Equality. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Appl. Algebra Eng. Commun. Comput. ![In: Appl. Algebra Eng. Commun. Comput. 10(3), pp. 203-225, 2000. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Comput. Geom. ![In: Discret. Comput. Geom. 22(1), pp. 1-18, 1999. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
14 | Piotr Ejdys, Grzegorz Góra |
The More We Learn the Less We Know? On Inductive Learning from Examples. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISMIS ![In: Foundations of Intelligent Systems, 11th International Symposium, ISMIS '99, Warsaw, Poland, June 8-11, 1999, Proceedings, pp. 262-270, 1999, Springer, 3-540-65965-X. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
14 | Jung Hee Cheon, Seongtaek Chee, Choonsik Park |
S-boxes with Controllable Nonlinearity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EUROCRYPT ![In: Advances in Cryptology - EUROCRYPT '99, International Conference on the Theory and Application of Cryptographic Techniques, Prague, Czech Republic, May 2-6, 1999, Proceeding, pp. 286-294, 1999, Springer, 3-540-65889-0. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 1997, 22nd International Symposium, MFCS'97, Bratislava, Slovakia, August 25-29, 1997, Proceedings, pp. 319-326, 1997, Springer, 3-540-63437-1. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
14 | Marcus Schäfer 0001 |
Deciding the Vapnik-Cervonenkis dimension is SigmaP3-complete. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the Eleveth Annual IEEE Conference on Computational Complexity, Philadelphia, Pennsylvania, USA, May 24-27, 1996, pp. 77-80, 1996, IEEE Computer Society, 0-8186-7386-9. The full citation details ...](Pics/full.jpeg) |
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). ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 95, 12th Annual Symposium on Theoretical Aspects of Computer Science, Munich, Germany, March 2-4, 1995, Proceedings, pp. 527-538, 1995, Springer, 3-540-59042-0. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
14 | Ted Stanion, Carl Sechen |
Quasi-algebraic decompositions of switching functions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ARVLSI ![In: 16th Conference on Advanced Research in VLSI (ARVLSI '95), March 27-29, 1995, Chapel Hill, North Carolina, USA, pp. 358-367, 1995, IEEE Computer Society, 0-8186-7047-9. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 41(6), pp. 1298-1328, 1994. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
machine learning, inductive inference |
14 | Leonard Pitt, Leslie G. Valiant |
Computational limitations on learning from examples. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 35(4), pp. 965-984, 1988. The full citation details ...](Pics/full.jpeg) |
1988 |
DBLP DOI BibTeX RDF |
|
14 | Katja Lenz, Ingo Wegener |
The Conjunctive Complexity of Quadratic Boolean Functions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSL ![In: CSL '87, 1st Workshop on Computer Science Logic, Karlsruhe, Germany, October 12-16, 1987, Proceedings, pp. 138-150, 1987, Springer, 3-540-50241-6. The full citation details ...](Pics/full.jpeg) |
1987 |
DBLP DOI BibTeX RDF |
|
Displaying result #201 - #219 of 219 (100 per page; Change: ) Pages: [ <<][ 1][ 2][ 3] |
|