Amanote Research
Register
Sign In
Comparing Universal Covers in Polynomial Time
doi 10.1007/978-3-540-79709-8_18
Full Text
Open PDF
Abstract
Available in
full text
Date
Unknown
Authors
Jiří Fiala
Daniël Paulusma
Publisher
Springer Berlin Heidelberg
Related search
Geometric Structures on Branched Covers Over Universal Links
Contemporary Mathematics
Mathematics
Finding Hamiltonian Cycle in Polynomial Time
Information Technology Journal
Comparing the Speed of Programs for Sparse Polynomial Multiplication
ACM SIGSAM Bulletin
Positive Versions of Polynomial Time
Information and Computation
Theoretical Computer Science
Computational Theory
Computer Science Applications
Information Systems
Mathematics
Near-Linear Time Construction of Sparse Neighborhood Covers
SIAM Journal on Computing
Mathematics
Computer Science
Polynomial Time Uniform Word Problems
Mathematical Logic Quarterly
Logic
Universal Time Coordinated (UTC)
Class Relevant Pattern Mining in Output-Polynomial Time
Landfill Covers: Is It Time to Change Current Regulations?
