- A simple method for sampling random Clifford operators
2020/08/13 by Ewout van den Berg, E. van den Berg, Berg, Ewout van den · 5 citations
Computer Science · Engineering · Mathematics · Physics and Astronomy · #Algebra over a field #Algorithm #Clifford algebra #Combinatorics #Computer science #Current (fluid) #Discrete mathematics #Electronic circuit #FOS: Physical sciences #Ferroelectric and Negative Capacitance Devices #Mathematics #Physics #Pure mathematics #Quantum #Quantum Computing Algorithms and Architecture #Quantum Physics (quant-ph) #Quantum mechanics #Quantum-Dot Cellular Automata #Qubit #SIMPLE algorithm #Sampling (signal processing) #Simple (philosophy) #Simple random sample #Simplicity #State (computer science) #Telecommunications #Topology (electrical circuits) #quant-ph
- Tight Bounds on Quantum Searching
1998/06/01 by Michel Boyer, Gilles Brassard, Peter Høyer +1 · 83 citations
Computer Science · Physics and Astronomy · #Element (criminal law) #Quantum #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum Mechanics and Applications #Quantum algorithm #Quantum phase estimation algorithm #SIMPLE algorithm #Simple (philosophy) #Table (database) #Upper and lower bounds
- A fast las vegas algorithm for triangulating a simple polygon
1989/10/01 by Kenneth L. Clarkson, Robert E. Tarjan, Christopher J. Van Wyk · 7 citations
Computer Science · Engineering · Mathematics · #3D Shape Modeling and Analysis #Algorithm #Combinatorics #Computational Geometry and Mesh Generation #Computer science #Convex set #Data Management and Algorithms #Geometry #Las vegas #Mathematics #Polygon (computer graphics) #Polygon covering #Randomized algorithm #Regular polygon #SIMPLE algorithm #Simple (philosophy) #Simple polygon #Star-shaped polygon
- An O(nlog log n)-Time Algorithm for Triangulating a Simple Polygon
1988/02/01 by Robert E. Tarjan, Christopher J. Van Wyk · 10 citations
Computer Science · Engineering · Mathematics · #Computational Geometry and Mesh Generation #Optimization and Search Problems #Robotics and Sensor-Based Localization #Simple polygon #Combinatorics #Polygon covering #Diagonal #Mathematics #Polygon (computer graphics) #Partition (number theory) #Simple (philosophy) #Computational geometry #Time complexity #Binary logarithm #Vertex (graph theory) #Triangulation #Algorithm #SIMPLE algorithm #Sorting #Monotone polygon #Computer science #Graph #Geometry
- A fast and simple randomized parallel algorithm for the maximal independent set problem
1986/12/01 by Noga Alon, László Babai, Alon Itai · 13 citations
Computer Science · Mathematics · #Advanced Graph Theory Research #Algorithm #Binary logarithm #Combinatorics #Complexity and Algorithms in Graphs #Computer science #Constant (computer programming) #Deterministic algorithm #Discrete mathematics #Graph #Independent set #Limits and Structures in Graph Theory #Line graph #Mathematics #Maximal independent set #Pairwise comparison #Parallel algorithm #Pathwidth #Probabilistic analysis of algorithms #Probabilistic logic #Randomized algorithm #SIMPLE algorithm #Set (abstract data type) #Simple (philosophy)
- A Simple Parallel Algorithm for the Maximal Independent Set Problem
1986/11/01 by Michael Luby · 66 citations
Computer Science · Mathematics · #Advanced Graph Theory Research #Algorithm #Complexity and Algorithms in Graphs #Computational Geometry and Mesh Generation #Computer science #Deterministic algorithm #Mathematical optimization #Mathematics #Monte Carlo method #Parallel algorithm #SIMPLE algorithm #Set (abstract data type) #Simple (philosophy)
- A strong-connectivity algorithm and its applications in data flow analysis
1981/01/01 by Micha Sharir, M. Sharir · 4 citations
Computer Science · Mathematics · #Algorithm #Connectivity #Data Stream Mining Techniques #Discrete mathematics #Flow (mathematics) #Graph #Iterative method #Mathematics #Network Security and Intrusion Detection #Network Traffic and Congestion Control #SIMPLE algorithm #Simple (philosophy) #Simple graph
- Approximation algorithms for combinatorial problems
1974/12/01 by David S. Johnson · 100 citations
Computer Science · Mathematics · #Advanced Graph Theory Research #Algorithm #Approximation algorithm #Bounded function #Clique #Clique problem #Combinatorial optimization #Combinatorics #Computer science #Constant (computer programming) #Constraint Satisfaction and Optimization #Data Management and Algorithms #Graph #Heuristic #Independent set #Line graph #Mathematical optimization #Mathematics #Pathwidth #Polynomial-time approximation scheme #SIMPLE algorithm #Satisfiability #Simple (philosophy) #Time complexity