User:Ale Qube/Books/a-Qube
 | The Wikimedia Foundation's book rendering service has been withdrawn. Please upload your Wikipedia book to one of the external rendering services. |
 | You can still create and edit a book design using the Book Creator and upload it to an external rendering service:
|
| This user book is a user-generated collection of Wikipedia articles that can be easily saved, rendered electronically, and ordered as a printed book. If you are the creator of this book and need help, see Help:Books (general tips) and WikiProject Wikipedia-Books (questions and assistance). Edit this book: Book Creator · Wikitext Order a printed copy from: PediaPress [ About ] [ Advanced ] [ FAQ ] [ Feedback ] [ Help ] [ WikiProject ] [ Recent Changes ] | ||||||||
a-Qube - Research[edit]
- Directed acyclic graph
- Graph theory
- Directed graph
- Cycle graph
- Topological sorting
- Binary decision diagram
- Transitive closure
- Transitive reduction
- Closure problem
- Feedback vertex set
- Feedback arc set
- NP-hardness
- Strongly connected component
- Graph (discrete mathematics)
- Tree (graph theory)
- Polytree
- Acyclic orientation
- Reachability
- Covering relation
- Graph drawing
- Hasse diagram
- Recurrence relation
- Graph enumeration
- Logical matrix
- Coppersmith–Winograd algorithm
- Dense graph
- Maximum flow problem
- Longest path problem
- Shortest path problem
- Dijkstra's algorithm
- Combinational logic
- Bayesian network
- Causal loop
- Moral graph
- Influence diagram
- Randomization
- Randomized algorithm
- Delaunay triangulation
- Network science
- Data structure
- Interpretation (logic)
- Decision tree
- Vickrey auction
- Incentive compatibility
- Multiunit auction
- Generalized second-price auction
- Vickrey–Clarke–Groves auction
- Expected utility hypothesis
- Price discovery
- Collusion
- Monotonic function
- Routing
- Added value
- Strategyproofness
- Unicast
- Multicast
- Erdős–Rényi model
- Reservation price
- Bayesian-optimal mechanism
- Marketplace of ideas
- Freedom of speech
- Free market
- Finite-state machine
- Model of computation
- Abstract machine
- Deterministic finite automaton
- Nondeterministic finite automaton
- State transition table
- State diagram
- Vertex (graph theory)
- Virtual finite-state machine
- Unified Modeling Language
- UML state machine
- Mealy machine
- Moore machine
- Specification and Description Language
- String (computer science)
- Semiring
- Empty string
- Finite-state transducer
- DFA minimization
- Implication table
- Moore reduction procedure
- Normal-form game
- Game theory
- Extensive-form game
- Strategic dominance
- Nash equilibrium
- Strategy (game theory)
- Complete information
- Perfect information
- Cardinal utility
- Ordinal utility
- Symmetric game
- Prisoner's dilemma
- Sequential game
- Tuple
- Move by nature
- Game tree
- Partition of a set
- Probability distribution
- Equivalence class
- Common knowledge (logic)
- Choice function
- A priori probability
- Von Neumann–Morgenstern utility theorem
- Combinatorial game theory
- Subgame perfect equilibrium
- Information set (game theory)
- Singleton (mathematics)
- Perfect Bayesian equilibrium
- Stackelberg competition
- Cournot competition
- Subgame
- Signaling game
- Partial derivative
- Intransitivity
- Rock–paper–scissors
- Arbitrage
- Max-dominated strategy
- Determinacy
- Risk dominance
- Curve fitting
- Function (mathematics)
- Interpolation
- Extrapolation
- Uncertainty
- Polynomial regression
- Polynomial interpolation
- Slope
- Osculating circle
- Curvature
- Spline (mathematics)
- Cloverleaf interchange
- Jerk (physics)
- Collinearity
- Least squares
- Runge's phenomenon
- Inflection point
- Sigmoid function
- Ordinary least squares
- Total least squares
- Normal distribution
- Cauchy distribution
- Voigt profile
- Plane curve
- Conic section
- Trigonometric functions
- Parametric equation
- Arc length
- Least squares adjustment
- Curve-fitting compaction
- Estimation theory
- Function approximation
- Goodness of fit
- Levenberg–Marquardt algorithm
- Nonlinear regression
- Overfitting
- Smoothing
- Probability distribution fitting
- Spline interpolation
- Smoothing spline
- Time series
- Linear trend estimation
- Lagrange polynomial
- Numerical analysis
- Newton–Cotes formulas
- Numerical integration
- Shamir's Secret Sharing
- Cryptography
- Secret sharing
- Cubic function
- Finite field
- Finite field arithmetic
- Information-theoretic security
- Verifiable secret sharing
- Homomorphic secret sharing
- Partial password
- Merkle–Hellman knapsack cryptosystem
- Public-key cryptography
- RSA (cryptosystem)
- Subset sum problem
- Digital signature
- Superincreasing sequence
- NP-completeness
- Greedy algorithm
- Coprime integers
- Modular multiplicative inverse
- Extended Euclidean algorithm
- Cryptosystem
- Key (cryptography)
- Encryption
- Factorization
- Integer factorization
- RSA problem
- Symmetric-key algorithm
- Primality test
- Carmichael function
- Fermat's little theorem
- Euler's theorem
- Coppersmith's attack
- Semantic security
- Deterministic algorithm
- Chosen-ciphertext attack
- Exponentiation by squaring
- RSA Factoring Challenge
- Integer factorization records
- Shor's algorithm
- Generalized Riemann hypothesis
- RSA numbers
- Wiener's attack
- Fermat's factorization method
- Pollard's p − 1 algorithm
- Random number generation
- Euclidean algorithm
- Chinese remainder theorem
- Blinding (cryptography)
- Adaptive chosen-ciphertext attack
- Padding (cryptography)
- Optimal asymmetric encryption padding
- Branch predictor
- Simultaneous multithreading
- Linear combination
- Kronecker delta
- Vandermonde matrix
- Identity matrix
- Fast Fourier transform
- Newton polynomial
- Chebyshev nodes
- Neville's algorithm
- Sylvester's formula
- Cryptographic protocol
- Non-repudiation
- Bit array
- Key generation
- Discrete uniform distribution
- Digital Signature Algorithm
- Adversary (cryptography)
- Negligible function
- Oracle machine
- Euler's totient function
- Trapdoor function
- Permutation
- Cryptographic hash function
- Full Domain Hash
- Chosen-plaintext attack
- Digital signature forgery
- Malleability (cryptography)
- Collision resistance
- Certificate revocation list
- Keystroke logging
- Elliptic-curve cryptography
- EdDSA
- ElGamal signature scheme
- Schnorr signature
- Pointcheval–Stern signature algorithm
- Rabin signature algorithm
- Pairing
- Undeniable signature
- Signatures with efficient protocols
- Zero-knowledge proof
- Secure multi-party computation
- Public key infrastructure
- Certificate authority
- Public key certificate
- Interoperability
- Key escrow
- Blind signature
- Advanced electronic signature
- Detached signature
- Digital signature in Estonia
- Electronic signatures and law
- GNU Privacy Guard
- Server-based signatures
- Probabilistic signature scheme
- Pseudorandom number generator
- Interactive proof system
- Turing machine
- PP (complexity)
- Probabilistic Turing machine
- Computational indistinguishability
- Discrete logarithm
- One-time pad
- Hamiltonian path
- Graph isomorphism
- Commitment scheme
- Graph isomorphism problem
- Statistically close
- Proof of knowledge
- Witness-indistinguishable proof
- Zero-knowledge password proof
- Quadratic residue
- Graph coloring
- One-way function
- Complement (complexity)
- Non-interactive zero-knowledge proof
- Arrow information paradox
- Feige–Fiat–Shamir identification scheme
- Decision problem
- Computational complexity theory
- Multiset
- Partition problem
- Time complexity
- Brute-force search
- Dynamic programming
- Pseudo-polynomial time
- Knapsack problem
- Combinatorial optimization
- Resource allocation
- Suffix tree
- Bin packing problem
- Securitization
- Knapsack cryptosystems
- Polynomial-time approximation scheme
- Hybrid algorithm
- Meet-in-the-middle attack
- Baby-step giant-step
- Approximation algorithm
- Quadratic knapsack problem
- Karp's 21 NP-complete problems
- Change-making problem
- Combinatorial auction
- Continuous knapsack problem
- Cutting stock problem
- List of knapsack problems
- Packing problems
- Visual cryptography
- Differential cryptanalysis
- Cryptanalysis
- Block cipher
- Randomness
- Data Encryption Standard
- Known-plaintext attack
- Ciphertext-only attack
- Exclusive or
- Cipher
- Affine transformation
- Higher-order differential cryptanalysis
- Truncated differential cryptanalysis
- Impossible differential cryptanalysis
- Boomerang attack
- Linear cryptanalysis
- Packet switching
- Network packet
- Header (computing)
- Payload (computing)
- Computer network
- Fault tolerance
- Queueing theory
- End-to-end principle
- Connectionless communication
- Connection-oriented communication
- Datagram
- Transport layer
- Network layer
- Signaling (telecommunications)
- Latency (engineering)
- Asynchronous transfer mode
- Message switching
- Multi-bearer network