35 results on '"NSF"'
Search Results
2. Perfect Information Leader Election in log* n+O(1) Rounds
3. The Minimum Equivalent DNF Problem and Shortest Implicants
4. The Communication Complexity of Enumeration, Elimination, and Selection
5. A Constant-Factor Approximation Algorithm for thek-MST Problem
6. On Approximate Nearest Neighbors under l∞ Norm
7. Algorithms for Matrix Groups and the Tits Alternative
8. Topological Queries in Spatial Databases
9. Deciding the Vapnik–Červonenkis Dimension is∑p3-complete
10. Monotonic Aggregation in Deductive Databases
11. On the Computation of Boolean Functions by Analog Circuits of Bounded Fan-In
12. The Hardness of Approximate Optima in Lattices, Codes, and Systems of Linear Equations
13. Specification and Simulation of Statistical Query Algorithms for Efficiency and Noise Tolerance
14. Good Degree Bounds on Nullstellensatz Refutations of the Induction Principle
15. Learning with Unreliable Boundary Queries
16. Approximations for the Disjoint Paths Problem in High-Diameter Planar Networks
17. The Relative Complexity of NP Search Problems
18. On the Equivalence of Recursive and Nonrecursive Datalog Programs
19. A Model of Interactive Teaching
20. Breaking theΘ(n log2 n) Barrier for Sorting with Faults
21. When Can We Sort ino(n log n) Time?
22. All Pairs Shortest Paths for Graphs with Small Integer Length Edges
23. On the Exponent of the All Pairs Shortest Path Problem
24. Counting Quantifiers, Successor Relations, and Logarithmic Space
25. The Isomorphism Conjecture Holds and One-Way Functions Exist Relative to an Oracle
26. (De)randomized Construction of Small Sample Spaces in [formula omitted][formula omitted]
27. Optimal Parallel Suffix Tree Construction
28. Finitely Representable Databases
29. Can Datalog Be Approximated?
30. A Query Language for NC
31. The Complexity of the Evaluation of Complex Algebra Expressions
32. Reductions in Circuit Complexity: An Isomorphism Theorem and a Gap Theorem
33. Integer Programming as a Framework for Optimization and Approximability
34. Arity Bounds in First-Order Incremental Evaluation and Definition of Polynomial Time Database Queries
35. Attribute-Efficient Learning in Query and Mistake-Bound Models
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.