Cargando…
Semialgebraic proofs and efficient algorithm design
The book provides the advanced reader with a deep insight into the exciting line of research, namely, proof that a solution exists has enabled an algorithm to find that solution itself with applications in many areas of computer science. It will inspire readers in deploying the techniques in their o...
Autores principales: | Fleming, Noah, Kothari, Pravesh, Pitassi, Toniann |
---|---|
Lenguaje: | eng |
Publicado: |
Now Publishers
2019
|
Materias: | |
Acceso en línea: | http://cds.cern.ch/record/2760367 |
Ejemplares similares
-
Semialgebraic Statistics and Latent Tree Models
por: Zwiernik, Piotr
Publicado: (2015) -
Locally semialgebraic spaces
por: Delfs, Hans, et al.
Publicado: (1985) -
Weakly semialgebraic spaces
por: Knebusch, Manfred
Publicado: (1989) -
Towards a Complexity-Theoretic Understanding of Restarts in SAT Solvers
por: Li, Chunxiao, et al.
Publicado: (2020) -
Geometry of subanalytic and semialgebraic sets
por: Shiota, Masahiro
Publicado: (1997)